This document discusses tree traversal algorithms. There are three common tree traversal methods: inorder, preorder, and postorder. Inorder traversal visits the left subtree, then the root, then the right subtree. Preorder traversal visits the root, then the left subtree, then the right subtree. Postorder traversal visits the left subtree, then the right subtree, then the root. Pseudocode and an example are provided to demonstrate inorder tree traversal.

2. TREE TRAVERSAL
TREE TRAVERSAL is the process of visiting
each node in the tree exactly once.
 It has three methods :

inorder traversal

preorder traversal

postorder traversal


3. ALGORITHM
Traverse the left subtree of root.
 Visit the root.
 Traverse the right subtree of the root


4. CODE
Inorder(ptr)
{ struct node*ptr;
{ if(ptr!=NULL)
{
inorder(ptr->left);
printf(“%c”,ptr->info);
inorder(ptr->right);
}
}
}

6. Procedure InOrderPrint(pointer)
pointer NOT NULL?
InOrderPrint(left child)
L
print(data)
P
InOrderPrint(right child)
R
root
A
C
B
D
E
G
H
AnswerDBFEAGCJHL
F
J
L

7. 

By the method of traversal we can also
find infix , postfix, prefix notation.
Infix notation can be obtained by inorder
traversal