Here a Binary search tree slide ... Most important topic in data structure . So please upload this file . And you can just do it practice work in presentation topic.

1. Welcome To
Our
Presentation
Binary Tree
Submitted To:
Afsara Tasneem
Misha

2. ALPHA 2
Group Member
1. Syed Sabbir Rahman
ID No : 152-15-5688
2. Mehedi Hashan
ID No :152-15-6103
3. Akash Saha
ID No: 152-15-5764
4. S.M. Fahad Bin Islam Abir
ID No: 152-15-6120
Group Name

4.  Property 1: Each node can have up to two
successor nodes.
Node
s

5. 1. Nodes Data item.
2. Root Top most node.
3. Leap Node without child.
4. Parent  B and C of parent
A
5. Child B,C,D,E,F,G,H,I,J.
6. Sibling  Nodes with same
parent.
7. Edges Connection.
Nodes
Root
Leaf
Edge
Sibling
child

6. Depth or Level : Level of A0.
Level of B  1.
Level of D  2.
Level of G  3.
Height  4.
Height

7.  Ordered v. unordered
 Binary tree
 Empty v non-empty
 Full
 Perfect
 Complete

8. The nodes
must always
fill the next
level from
Left to right.

9. The next
nodes must
always fill the
next level
from left to
right.

10. • full tree: a binary tree is which each
binary node was exactly 2 or 0 children

12. CS 103 12
6
15
8
2 11
18 12
20
27
13
30
15 8 20 2 11 30 27 13 6 10 12
1 2 3 4 5 6 7 8 9 10 11

13. Abstract Tree Model
A
E F
H
D
CB
G

14. A
JI
HGFE
DCB
(a)
(b)
A GENERAL TREE

16. 2, 7, 2, 6, 5, 11, 5, 9, 4
Preorder Traversal

17. 2, 5, 11, 6, 7, 4, 9, 5, 2
Post order Traversal

18. Thank You