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).

0 files changed, 0 insertions, 0 deletions