Leetcode 270. Closest Binary Search Tree Value

Given a Binary Search Tree and a target numeric value, return the value of the node in the tree that is closest to the target. Leverage the BST ordering to traverse toward the target and maintain the best candidate (can be done in O(h) time, where h is tree height).