1. Advanced Data Structure using C++

c.
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Strictly binary tree
DEGREE: The number of nodes connected to a particular node is called degree of
that node .for eg;the node conataining data ‘D’ has a degree 3.The degree of a
leaf node is always one
LEVEL: The root node of the tree has level 0.The level of any other child node is
one more than the level of its father.for eg;, in the binary tree as in fig; node ‘E’
is at level 2 and node ‘H’ is at level 3.
DEPTH: The maximum level of any leaf node in the tree is called depth of the
binary tree.for eg; the depth of the tree shown in fig; below
Binary tree
A
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M B (Kaithal) C
Page ‐ 184 ‐
E