Tap here to switch tabs
Problem
Submissions

Problem: Closest Binary Search Tree Value

Closest Binary Search Tree Value finds the node value nearest a floating-point target in a binary search tree, returning the smaller value when two nodes are equally close.

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 ≤109\leq 10^9

  • −109≤-10^9 \leq target ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Closest Binary Search Tree Value

Closest Binary Search Tree Value finds the node value nearest a floating-point target in a binary search tree, returning the smaller value when two nodes are equally close.

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 ≤109\leq 10^9

  • −109≤-10^9 \leq target ≤109\leq 10^9