Function inorder_successor

binary_search_trees/inorder_successor.py:4–13

This function returns the inorder successor of a node in a BST

(root: Node)

def inorder_successor(root: Node) -> Node:
    """This function returns the inorder successor of a node in a BST"""

    # The inorder successor of a node is the node with the smallest value greater than the value of the node
    current: Node = root

    # The inorder successor is the leftmost node in the right subtree
    while current.left is not None:
        current = current.left
    return current