The fundamental operations on a BST are:

public void insert(Integer val)

public void find(Integer val)

public boolean remove(Integer val)

public void print()


When implemented properly, BSTs perform insertions and deletions faster than can be done on Linked Lists and performs any find with as much efficiency as the binary search on a sorted array.

In addition, because of the BST Rule, the BST keeps all data in sorted order, and the algorithm for displaying all data in its sorted order is very efficient.

Fundamental Operations on Binary Search Tree
It's only fair to share...Share on FacebookTweet about this on TwitterShare on LinkedInShare on Google+Email this to someonePrint this page
Tagged on:     

Leave a Reply

Your email address will not be published. Required fields are marked *