This document discusses techniques for binary trees, including that a binary tree is a data structure where each parent node has two child nodes (left and right), and describes the three common traversal orders for binary trees: inorder traversal (which visits left subtree, then root, then right subtree), preorder traversal (which visits root, then left subtree, then right subtree), and postorder traversal (which visits left subtree, then right subtree, then root).

1. NADAR SARASWATHI COLLEGE
OF ARTS AND SCIENCE THENI.
Department Of Computer Science
TECHNIQUES FOR BINARY TREE
M.SHAKTHI
MSC(CS)

2. TECHNIQUES FOR BINARY TREE

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

6. 1.INORDER TRAVERSAL

7. 2.PREORDER TRAVERSAL:

8. 3.POSTORDER TRAVERSAL:

9. Example of binary tree:

10. THANK YOU