Leetcode 700. Search in a Binary Search Tree

Given the root of a binary search tree and a target value, return the subtree rooted at the node whose value equals the target (or null if no such node exists). Use the BST ordering to locate the node efficiently in O(height) time.