Discrete Mathematics Lectures. **Subrata Kumer Paul**

1. DISCRETE MATHEMATICS
ICE2151
Md.Nazmul Hussain
Lecturer
Dept. of ICE
BAUET
5/14/2022 Dept. of Infomation and Communiction Engineering 1
Lecture 8

2. ■ What do you mean by tree traversal?
■ In discrete mathematics, tree traversal (also known
as tree search and walking the tree) refers to the process
of visiting (checking and/or updating) each node in a tree ,
exactly once.
5/14/2022 Dept. of Infomation and Communiction Engineering 2

3. 5/14/2022 Dept. of Infomation and Communiction Engineering 3

4. ■ i.Inorder (left, root, right)=4,2,5,1,3
■ ii.preorder (root, left, right)=1,2,4,5,3
■ iii.postorder (left, right, root)=4,5,2,3,1
5/14/2022 Dept. of Infomation and Communiction Engineering 4

5. 5/14/2022 Dept. of Infomation and Communiction Engineering 5

6. 5/14/2022 Dept. of Infomation and Communiction Engineering 6

7. 5/14/2022 Dept. of Infomation and Communiction Engineering 7

8. 5/14/2022 Dept. of Infomation and Communiction Engineering 8

9. ■ A binary tree is a tree-like structure that is rooted and in
which each vertex has at most two children and each child
of a vertex is designated as its left or right child
5/14/2022 Dept. of Infomation and Communiction Engineering 9

10. 5/14/2022 Dept. of Infomation and Communiction Engineering 10