Given a binary search tree, find the length of the path between two nodes.
Anonymous
Find the first node, once you found it, use it as a root to your bst and count up ultil you find the next element...
Check out your Company Bowl for anonymous work chats.