Trees

Overview

• Tree traversals (preorder, inorder, postorder)

• Binary search trees

• Balanced search trees

• Binary trees

• AVL-trees

• B-trees

• Red-black trees

Binary search trees

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.

implementation of BST with Python

Tree traversals (preorder, inorder, postorder)