Inorder Successor in BST

Explore how to find the inorder successor of a given node in a binary search tree. Understand the problem constraints and develop a solution that returns the smallest node greater than the target node, or null if none exists. Practice implementing this common tree problem efficiently.