BINARY SEARCH TREE | Data Structures tutorial pdf

BINARY SEARCH TREE:- A binary search tree is a special type of binary tree where all the elements to the left of the root are lesser than the root element and all elements to the right of the root are greater than the root element.