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
Veeam Data Platform v13.1
Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Binary search tree!