Find next larger element in BST, given key might not be in BST. O(logn) time and O(1) space

• Start at root node and traverse down the tree

• If key is less than or equal to current node, go left

• If key is g...read more