mdebray/tvl-depot
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
1548 commits 5 branches 0 tags 172 MiB
Commit graph

2 commits

Author SHA1 Message Date
William Carroll
2b5bbb98ca Refactor existing bst-checker implementation 
I believe the previous solution is invalid. This solution works and it should be
more time and space efficient.

Space-wise our stack grows proportionate to the depth of our tree, which for a
"balanced" BST should be log(n). Doing a BFT on a BST results in memory usage of
n because when we encounter the leaf nodes at the final level in the tree, they
will be 1/2 * n for a balanced BST.
 2020-11-21 14:14:50 +00:00
William Carroll
aa66d9b83d Add coding exercises for Facebook interviews 
Add attempts at solving coding problems to Briefcase.
 2020-11-12 14:37:29 +00:00