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

Completed BSTs.

Browse Source
This commit is contained in:
John Washam 2016-07-06 17:16:36 -07:00
parent f8163d55cf
commit 536b5b48e8
1 changed files with 12 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
README.md
View File

@ -407,6 +407,18 @@ Then test it out on a computer to make sure it's not buggy from syntax.
- [x] https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P - [x] https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
- [x] https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36 - [x] https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36
- [x] https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P - [x] https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
- [ ] Implement:
- [x] insert // insert value into tree
- [x] get_node_count // get count of values stored
- [x] print_values // prints the values in the tree, from min to max
- [x] delete_tree
- [x] is_in_tree // returns true if given value exists in the tree
- [x] get_height // returns the height in nodes (single node's height is 1)
- [x] get_min // returns the minimum value stored in the tree
- [x] get_max // returns the maximum value stored in the tree
- [x] is_binary_search_tree
- [x] delete_value
- [x] get_successor // returns next-highest value in tree after given value, -1 if none
- [x] **Balanced binary trees** - [x] **Balanced binary trees**
- Know least one type of balanced binary tree (and know how it's implemented): - Know least one type of balanced binary tree (and know how it's implemented):