Binary Search Trees
Description:
- Binary Search Tree Review - Youtube (video)
- BST Core - Coursera (video)
- starts with symbol table and goes through BST applications
- BST - Coursera (video)
- BST - MIT 6.006 (video)
- Binary search tree - Implementation in C/C++ - Youtube (video)
- BST implementation - memory allocation in stack and heap - Youtube (video)
- Find min and max element in a binary search tree - Youtube (video)
- Find height of a binary tree - Youtube (video)
- Binary tree traversal - breadth-first and depth-first strategies - Youtube (video)
- Binary tree: Level Order Traversal - Youtube (video)
- Binary tree traversal: Preorder, Inorder, Postorder - Youtube (video)
- Check if a binary tree is binary search tree or not - Youtube (video)
- Delete a node from Binary Search Tree - Youtube (video)
- Inorder Successor in a binary search tree - Youtube (video)
Implement:
- insert // insert value into tree
- get_node_count // get count of values stored
- print_values // prints the values in the tree, from min to max
- delete_tree
- is_in_tree // returns true if given value exists in the tree
- get_height // returns the height in nodes (single node's height is 1)
- get_min // returns the minimum value stored in the tree
- get_max // returns the maximum value stored in the tree
- is_binary_search_tree
- delete_value
- get_successor // returns next-highest value in tree after given value, -1 if none