Leetcode 285. Inorder Successor in BST

Given the root of a binary search tree and a target node p, return p's in-order successor — the node with the smallest key greater than p's key. Leverage BST ordering (e.g., examine p's right subtree or traverse from the root tracking potential successors) to achieve O(h) time.