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
    
                    
                    MongoDB Atlas runs apps anywhere
                    
                    
                
            
                            MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
                        
                    Rate This Project
Login To Rate This Project
    User Reviews
            Be the first to post a review of Binary search tree!