47a11b76a2
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. |
||
---|---|---|
.. | ||
crack_the_coding_interview | ||
data_structures_and_algorithms | ||
deepmind | ||
README.md |
Scratch
The purpose of the scratch
directory is to host practice exercises. Practice
encompasses things like working on data structures and algorithms problems for
upcoming coding interviews or general aptitude as well as writing code snippets
to help me learn a new programming language or understand an unfamiliar concept.