Binary Search Tree

BST(Binary Search Tree)

A binary search tree or Ordered binary tree is a binary tree in which all nodes have the following properties

For each node
All elements in its left subtree are less than or equal to the node
All elements in its right subtree are greater than the node.

Example

Binary Search Tree figure: 1

 

 

Detailed Implimentation of the above figure : 2


Next > < Prev
Scroll to Top