Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
The remaining nodes are partitioned into n>=0 disjoint sets T1,
..., Tn, where each of these sets is a tree.
C D E F
H I J K L M
P Q
Tree representation
A Root
C D E F
H I J K L M
Subtree with Q
P
single node Subtree
with root F
Subtree with
root D
A Level 0
Root
Parent
Child Level 1
C D E
Siblings B
Leaves
F G H Level 2
A Level 0
Root
Parent
Child Level 1
C D E
Siblings B
Leaves
F G H Level 2
A is Root Node
I Level 3
A is Parent of B, C, D and E
F and G are Child of D
F, and G are Siblings
B, C, F, G and I are leaves
Tree Terminology
A Level 0
Level 1
C D E
B
Height of Tree is 3
The Degree of node D is 2
I Level 3
B, C, F, G and I are External
A , D, E, H are internal node of Tree
Binary Trees
Binary Tree
Binary Tree:
Ordered tree with all nodes having at most two children
Some examples
A
B C
D E F
G H I
Binary tree
Structures which are not binary trees
A
B C
D E F
G I
Various binary trees
2 B 3 C
4 D 5 E 6 F 7 G
8 H 9 I J 10
B C
D E
F G
A COMPLETE BINARY TREE OF DEPTH 3
B C
D E G F
H I J K L M N O
Complete Binary Tree
• Finding duplicates
• Traversing a binary tree
• Searching
Binary Tree Traversals
Tree Traversal
• Preorder traversal
• Inorder traversal
• Postorder traversal
Preorder Traversal
Steps:
B C
D E F G
H I
Traversing a Tree Preorder
B C
D E F G
H I
Result: A
Traversing a Tree Preorder
B C
D E F G
H I
Result: AB
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABD
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABDE
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABDEH
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABDEHC
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABDEHCF
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABDEHCFG
Traversing a Tree Preorder
B C
D E F G
H I
Result: ABDEHCFGI
Inorder Traversal (symmetric order)
B C
D E F G
H I
Traversing a Tree Inorder
B C
D E F G
H I
Traversing a Tree Inorder
B C
D E F G
H I
Traversing a Tree Inorder
B C
D E F G
H I
Result: D
Traversing a Tree Inorder
B C
D E F G
H I
Result: DB
Traversing a Tree Inorder
B C
D E F G
H I
Result: DB
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBH
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHE
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHEA
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHEA
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHEAF
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHEAFC
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHEAFCG
Traversing a Tree Inorder
B C
D E F G
H I
Result: DBHEAFCGI
Postorder Traversal
Steps:
B C
D E F G
H I
Traversing a Tree Postorder
B C
D E F G
H I
Result:
Traversing a Tree Postorder
B C
D E F G
H I
Result:
Traversing a Tree Postorder
B C
D E F G
H I
Result: D
Traversing a Tree Postorder
B C
D E F G
H I
Result: D
Traversing a Tree Postorder
B C
D E F G
H I
Result: DH
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHE
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEB
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEB
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEBF
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEBF
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEBFI
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEBFIG
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEBFIGC
Traversing a Tree Postorder
B C
D E F G
H I
Result: DHEBFIGCA
Tree Traversal – Example 1
A
B C
D E F
G H I
Preorder: ABDGCEHIF
Inorder: DGBAHEICF
Postorder:
GDBHIEFCA
Tree Traversal – Example 2
A
Preorder: ABCEIFJDGHKL
Inorder: EICFJBGDKHLA
Postorder: IEJFCGKLHDBA
B
C D
G H
E F
K L
I J
Preorder, Postorder and Inorder