Browse Code
Binary Search Tree is a binary tree in which the nodes can have at most 2 childrens. The childrens are differenciated such that the left chile is lesser than parent and right child is greater than parent.
P
/ \
(LC < p) / \ (RC > p)
/ \
LC RC
Follow Binary search tree
Other Useful Business Software
Get the most trusted enterprise browser
Defend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Binary search tree!