diff options
| author | William Carroll <wpcarro@gmail.com> | 2020-03-15T23·09+0000 |
|---|---|---|
| committer | William Carroll <wpcarro@gmail.com> | 2020-03-15T23·09+0000 |
| commit | 56d8d1d7b2ac2e6ea15150f5b2e72a26b721d927 (patch) | |
| tree | 759765589b901761544eab69927c873d7c2fd441 /scratch/deepmind/part_two/todo.org | |
| parent | 47a11b76a255e1e0519fc3a9c5a59047d5d32569 (diff) | |
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).
Diffstat (limited to 'scratch/deepmind/part_two/todo.org')
| -rw-r--r-- | scratch/deepmind/part_two/todo.org | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/scratch/deepmind/part_two/todo.org b/scratch/deepmind/part_two/todo.org index 3ddd9206ac9d..97b5e6fad3c2 100644 --- a/scratch/deepmind/part_two/todo.org +++ b/scratch/deepmind/part_two/todo.org @@ -22,7 +22,7 @@ ** DONE Merging Meeting Times * Trees and graphs ** DONE Balanced Binary Tree -** TODO Binary Search Tree Checker +** DONE Binary Search Tree Checker ** TODO 2nd Largest Item in a Binary Search Tree ** TODO Graph Coloring ** TODO MeshMessage @@ -33,7 +33,7 @@ ** TODO Making Change ** TODO The Cake Thief ** DONE Balanced Binary Tree -** TODO Binary Search Tree Checker +** DONE Binary Search Tree Checker ** TODO 2nd Largest Item in a Binary Search Tree * Queues and stacks ** TODO Largest Stack |