-
-
Notifications
You must be signed in to change notification settings - Fork 805
Closed
Labels
Description
Aim
To create a directory in data structures for trees and adding tree-related algorithm explanations there
It will include
- Binary Tree and BST implementation as ADT
- Height order traversal: Inorder traversal (both recursive and non-recursive)
- Height order traversal: Preorder traversal (both recursive and non-recursive)
- Height order traversal: Postorder traversal (both recursive and non-recursive)
- Level order traversal (both recursive and non-recursive)
- Vertical order traversal (both recursive and non-recursive)
for BST:
- BST searching
- BST addition
- BST deletion
NOTE
Including above algos if not already implemented or included in other Repos.