- What is printed out with various pointers to a string - Next largest element in a BST given a node
Anonymous
Traverse the tree using inorder traversal and store the nodes in an array (it'll be a resulting sorted array). you can then find the element next to your key in linear time.
Check out your Company Bowl for anonymous work chats.