- Binary tree
- Data Structure and Algorithms - Tree
- Tree Traversal
- Binary Search Tree
- Data structures: Binary Tree
- What is a binary tree
- What is the difference between a binary tree and a Binary Search Tree
- What is the possible gain in terms of time complexity compared to linked lists
- What are the depth, the height, the size of a binary tree
- What are the different traversal methods to go through a binary tree
- What is a complete, a full, a perfect, a balanced binary tree
| Task | File |
|---|---|
| 0. New node | 0-binary_tree_node.c |
| 1. Insert left | 1-binary_tree_insert_left.c |
| 2. Insert right | 2-binary_tree_insert_right.c |
| 3. Delete | 3-binary_tree_delete.c |
| 4. Is leaf | 4-binary_tree_is_leaf.c |
| 5. Is root | 5-binary_tree_is_root.c |
| 6. Pre-order traversal | 6-binary_tree_preorder.c |
| 7. In-order traversal | 7-binary_tree_inorder.c |
| 8. Post-order traversal | 8-binary_tree_postorder.c |
| 9. Height | 9-binary_tree_height.c |
| 10. Depth | 10-binary_tree_depth.c |
| 11. Size | 11-binary_tree_size.c |
| 12. Leaves | 12-binary_tree_leaves.c |
| 13. Nodes | 13-binary_tree_nodes.c |
| 14. Balance factor | 14-binary_tree_balance.c |
| 15. Is full | 15-binary_tree_is_full.c |
| 16. Is perfect | 16-binary_tree_is_perfect.c |
| 17. Sibling | 17-binary_tree_sibling.c |
| 18. Uncle | 18-binary_tree_uncle.c |
| 19. Lowest common ancestor | 100-binary_trees_ancestor.c |
| 20. Level-order traversal | 101-binary_tree_levelorder.c |
| 21. Is complete | SOON |
| 22. Rotate left | SOON |
| 23. Rotate right | SOON |
| 24. Is BST | SOON |
| 25. BST - Insert | SOON |
| 26. BST - Array to BST | SOON |
| 27. BST - Search | SOON |
| 28. BST - Remove | SOON |
| 29. Big O #BST | SOON |
| 30. Is AVL | SOON |
| 31. AVL - Insert | SOON |
| 32. AVL - Array to AVL | SOON |
| 33. AVL - Remove | SOON |
| 34. AVL - From sorted array | SOON |
| 35. Big O #AVL Tree | SOON |
| 36. Is Binary heap | SOON |
| 37. Heap - Insert | SOON |
| 38. Heap - Array to Binary Heap | SOON |
| 39. Heap - Extract | SOON |
| 40. Heap - Sort | SOON |
| 41. Big O #Binary Heap | SOON |