1. Advanced Data Structure using C++

1
3
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Struct tnode*right;
};
TWO OF REPRESENTING BINARY TREE ARE
Linked representation of binary tree
Array representation of binary tree
Insertion in binary tree:
A binary tree is constructed by the repeated insertion of new nodes into a
binary tree structure. Insertion must maintain the order of the tree. That is,
values to the left of a given node must be less than that node, and values to the
right must be greater. Inserting into a non‐empty tree.:
before insertion 5 after insertion 5
4
7
Deletion in binary tree:
8
6 3
1
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 187 ‐
4
5
7
6
8