In-Order Successor in Binary Search Tree

In-Order Successor in Binary Search Tree: a task in Terminal-Lego-15k (Harbor dataset). Given a node in a Binary Search Tree (BST), implement a function to find the in-order successor of that node. The in-order successor is the node with the smallest key greater than the given node's key.