-
Binary search trees: BSTs
- Binary Search Tree Review (video)
- Introduction (video)
- MIT (video)
- C/C++:
- Binary search tree - Implementation in C/C++ (video)
- BST implementation - memory allocation in stack and heap (video)
- Find min and max element in a binary search tree (video)
- Find height of a binary tree (video)
- Binary tree traversal - breadth-first and depth-first strategies (video)
- Binary tree: Level Order Traversal (video)
- Binary tree traversal: Preorder, Inorder, Postorder (video)
- Check if a binary tree is binary search tree or not (video)
- Delete a node from Binary Search Tree (video)
- Inorder Successor in a binary search tree (video)
- Implement:
- insert <-- Insert value into tree
- GetNodeCount <-- Get count of stored nodes
- printvalues <-- Prints the values of nodes in the tree, from min to max
- deletetree <-- Delete whole tree
- isintree <-- Returns boolean if given value exists or not in tree
- getheight <-- Returns the height in nodes (single node's height is 1)
- getmin <-- Returns the minimum value stored in the tree
- getmax <-- Returns the maximum value stored in the tree
- IsBST <-- Return boolean if its BST
- deletevalue <-- Delete node by given node
- getsuccessor <-- Returns next-highest value in tree after given value, -1 if none
- GetLevelOrder <-- Returns node values by level location