What is BST

In Binary Search Tree the value of the left node is smaller than the parent node and the right node's value is greater than the parent node.

What it does

It validates if a Tree is a Binary search tree or not.

How we built it

I wrote the program using Java Programming language.

Built With

Share this project:

Updates