Binary search Tree:
- A binary tree, In which at each level the node value is lies between the left node and right node.
- left node has less value as parent node
- right node has greater value as parent node
Implementation of Binary search tree
Learn more
Operation in Binary Search Tree:
Insertion: insertion is done in BST according to the value.
Search: searching an element in a tree.
Traversing of BST :
preorder traversing : Node Left Right
postorder traversing : Left Right Node
inorder traversing : Left Node Right