From 536b5b48e8212b58006b2d56539d07ed2cb1e801 Mon Sep 17 00:00:00 2001 From: John Washam Date: Wed, 6 Jul 2016 17:16:36 -0700 Subject: [PATCH] Completed BSTs. --- README.md | 12 ++++++++++++ 1 file changed, 12 insertions(+) diff --git a/README.md b/README.md index a16337a..4b1e083 100644 --- a/README.md +++ b/README.md @@ -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=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36 - [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** - Know least one type of balanced binary tree (and know how it's implemented):