2 docs tagged with "Binary Search Tree"

Find the lowest common ancestor (LCA) of two given nodes, `p` and `q`, in a Binary Search Tree (BST).

Determine if a given binary tree is a valid binary search tree (BST).