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

Added notes on splay and red/black trees.

Browse Source
This commit is contained in:
John Washam
2016-07-14 19:34:06 -07:00
parent 1268417f21
commit 3506070b9b
1 changed files with 5 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
README.md
View File

@@ -445,9 +445,12 @@ Then test it out on a computer to make sure it's not buggy from syntax.
- "Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular. - "Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular.
A particularly interesting self-organizing data structure is the splay tree, which uses rotations A particularly interesting self-organizing data structure is the splay tree, which uses rotations
to move any accessed key to the root." - Skiena to move any accessed key to the root." - Skiena
- Of these, I chose to implement a red-black tree and a splay tree. - Of these, I chose to implement a splay tree. From what I've read, you won't implement a
- red-black tree: search and insertion functions, skipping delete balanced search tree in your interview. But I wanted exposure to coding one up
and let's face it, splay trees are the bee's knees. I did read a lot of red-black tree code.
- splay tree: insert, search, delete functions - splay tree: insert, search, delete functions
If you end up implementing red/black tree try just these:
- 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] **AVL trees** - [x] **AVL trees**