William Carroll 56d8d1d7b2 Solve InterviewCake's bst-checker problem ... Write a function that returns true if a given binary tree is a valid binary search tree (i.e. if all of root's left nodes are less than root.value, all of root's right nodes are greater than root.value, and both left and right subtrees are also valid binary search trees).		2020-03-15 23:09:29 +00:00
..
part_one	Tidy up structure of briefcase	2020-02-12 16:58:29 +00:00
part_two	Solve InterviewCake's bst-checker problem	2020-03-15 23:09:29 +00:00