1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
TREES
Binary tree: A binary tree consists of a finite set of elements that can be
partitioned into three distinct sub‐ sets called the root, the left and the right
sub‐tree.If there are no elements in the binary tree ,it is known as empty binary
tree.A binary tree ‘T’ is either empty or has a finite collections of
elements.When the binary tree is not empty,one of its elements is called the
root and the remaining elements,if any,are partitioned into two binary
trees,which are known as left & right sub tree of T.
The essential difference between a binary tree and a tree are
A binary tree can be empty whereas a tree cannot.Each element in binary tree
has at most two sub‐trees(one or both of these sub‐tree may be empty).Each
element in a tree can have any number of sub‐trees.
The sub‐trees of each element in a binary tree are ordered.That is,we
distinguish between the left and right sub tree.The sub tree in a tree are
unordered.
Here are some of the binary trees that represents arithmetic expressions.Each
operator(+, ‐, *, /) may have one or two operands.The left operand ,if any,is the
left sub‐tree of the operator & the right operand is the right
sub tree.The leaf elements in an expression tree are either constants or
variables.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 176 ‐