diff options
author | William Carroll <wpcarro@gmail.com> | 2020-03-14T12·48+0000 |
---|---|---|
committer | William Carroll <wpcarro@gmail.com> | 2020-03-14T12·48+0000 |
commit | 47a11b76a255e1e0519fc3a9c5a59047d5d32569 (patch) | |
tree | cd784520f0aaa86274477a72444bc7076da198bc /scratch/deepmind/part_two/todo.org | |
parent | 0f82a527de0f6701021c106f108b5a8145f9226d (diff) |
Solve InterviewCake's balanced-binary-tree problem
Write a predicate for determining if a binary tree is "super balanced", which means that the depths of all of the tree's leaves are equal or differ by at most one.
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 473973c415fc..3ddd9206ac9d 100644 --- a/scratch/deepmind/part_two/todo.org +++ b/scratch/deepmind/part_two/todo.org @@ -21,7 +21,7 @@ ** DONE Top Scores ** DONE Merging Meeting Times * Trees and graphs -** TODO Balanced Binary Tree +** DONE Balanced Binary Tree ** TODO Binary Search Tree Checker ** TODO 2nd Largest Item in a Binary Search Tree ** TODO Graph Coloring @@ -32,7 +32,7 @@ ** TODO Compute nth Fibonacci Number ** TODO Making Change ** TODO The Cake Thief -** TODO Balanced Binary Tree +** DONE Balanced Binary Tree ** TODO Binary Search Tree Checker ** TODO 2nd Largest Item in a Binary Search Tree * Queues and stacks |