maurice/snix
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Solve InterviewCake's balanced-binary-tree problem

Browse source 
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.
This commit is contained in:
William Carroll 2020-03-14 12:48:37 +00:00
parent 0f82a527de
commit 47a11b76a2
2 changed files with 128 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
scratch/deepmind/part_two/todo.org
View file

@ -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