Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Closest Binary Search Tree Value

Explore how to leverage the binary search tree property to efficiently find the closest node value to a floating point target. Understand the step-by-step traversal from root to leaf using depth-first search, compare distances dynamically, and learn to handle tie cases by choosing the smaller value.

We'll cover the following...

Statement

Given the root of a binary search tree and a floating point target value, find the node value in the BST that is closest to target. If there are multiple node values with the same minimum distance to target, return the smallest among them.

Note: The target is a floating point number, while all node values are integers.

Constraints:

  • The number of nodes in the tree is in the range [1,104][1, 10^4].

  • 0≤0 \leq Node.val ≤10 ...