Overview
- Tree traversals (preorder, inorder, postorder)
- Binary search trees
- Balanced search trees
- Binary trees
- AVL-trees
- B-trees
- Red-black trees
Binary search trees
{% hint style="info" %} A type of data structure that store data in a hierarchical manner. Searching, insertion, and deletion of elements operations are O(log n) on average, n is the number of elements in the tree. {% endhint %}
{% embed url="https://gist.github.com/Aisuko/d07140a2ef676df718317666efcbe428" %} implementation of BST with Python {% endembed %}
Tree traversals (preorder, inorder, postorder)
{% embed url="https://gist.github.com/Aisuko/9868c67deccc79a4bb3b9372d715dc41" %}