Inorder Successor in BST

Explore how to find the inorder successor of a given node in a binary search tree using depth-first search techniques. Understand the problem constraints and practice implementing solutions to return the node with the smallest value greater than the target node.