gaspersic/coding-interview-university
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added one more reference for BBSTs.

Browse Source
This commit is contained in:
John Washam
2016-07-15 13:09:59 -07:00
parent 8ebc36851d
commit 6b888a2e38
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
README.md
View File

@ -452,6 +452,7 @@ Then test it out on a computer to make sure it's not buggy from syntax.
If you end up implementing red/black tree try just these: If you end up implementing red/black tree try just these:
- search and insertion functions, skipping delete - search and insertion functions, skipping delete
- I want to learn more about B-Tree since it's used so widely with very large data sets. - I want to learn more about B-Tree since it's used so widely with very large data sets.
- [x] Self-balancing binary search tree: https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
- [x] **AVL trees** - [x] **AVL trees**
- In practice: - In practice: