William Carroll 319652fe08 Solve InterviewCake's second-largest-item-in-bst ... Return a function that returns the second largest item in a binary search tree (i.e. BST). A BST is a tree where each node has no more than two children (i.e. one left child and one right child). All of the values in a BST's left subtree must be less than the value of the root node; all of the values in a BST's right subtree must be greater than the value of the root node; both left and right subtrees must also be BSTs themselves. I solved this problem thrice -- improving the performance profile each time. The final solution has a runtime complexity of O(n) and a spacetime complexity of O(1).		2020-03-16 11:45:34 +00:00
..
part_one	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
part_two	Solve InterviewCake's second-largest-item-in-bst	2020-03-16 11:45:34 +00:00