Closest Binary Search Tree Value, is a LeetCode problem from Search subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Closest Binary Search Tree Value at LeetCode

Solution

the comparation between node.val and target

Note: different data types of vars cannot operate together, e.g. Int and Double

Time Complexity: O(logn), Space Complexity: O(1)

Definition for a binary tree node.

public class TreeNode {

public var val: Int

public var left: TreeNode?

public var right: TreeNode?

public init(_ val: Int) {

    self.val = val

    self.left = nil

    self.right = nil

}

}

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu