1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
+ 2 3 4
+ 2 3 4
+ 2 3 4
5 4
Binary Search tree.
Answer 20
A binary search tree is a binary tree with the nodes arranged so as to support
binary search, that is:
1. THE LEFT CHILD’S KEY IS ALWAYS LESS THAN THE PARENT’S KEY;
2. THE RIGHT CHILD’S KEY IS ALWAYS GREATER THAN THE PARENT’S KEY.
We can visualize each node as having two pointers – a Left pointer to the left
child and a Right pointer to the right child.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 198 ‐