3. Binary Tree
Binary tree is a one type of data structure
Each parent node have a two child node.
Atmost Two child (left child,right child)
The binary trees are perform some
operations.
4. Traversing a tree
•visiting each node exactly once
•produces linear order for information in a tree
Three ways of binary tree Traversal
1.INORDER TRAVERSAL
2.PREORDER TRAVERSAL
3.POSTORDER TRAVERSAL
5. 1. INORDER TRAVERSAL
left subtree-Root-Right subtree
2. PREORDER TRAVERSAL
Root-left subtree-right subtree
3.POSTORDER TRAVERSAL
left subtree-right subtree- Root