BST Search
Binary Search Tree Search Binary Search Tree (BST) search locates a key by following the tree structure and using the ordering invariant: all keys in the left subtree are smaller all keys in the right subtree are larger This property allows you to discard half of the remaining subtree at each step, similar in spirit to binary search on arrays. Problem Given a binary search tree with root node root...