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

Closest Binary Search Tree Value

Explore how to identify the node value in a binary search tree that is closest to a floating point target. Understand practical DFS approaches to navigate the tree, compare node values, and handle ties by returning the smallest value. This lesson helps you apply tree traversal and problem-solving strategies for coding interviews.

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] ...