Data Structure: Balanced Search Trees


Tomorrow i have Exam on Data Structures. For preparing for that i found the following study materials to be very useful:
1. AVL Trees – Wikipedia
2. Red-Black Trees – Wikipedia
3. (i) 2-3 Trees. Insertion & deletion links are given in this page.
(ii) There is one more paper whose ideology of 2-3 tree is little different from the one mentioned above. Here it is. I would like to mention that the 3.(ii) ideology is taught generally. But we(IIT Kharagpur & IISc Bangalore) were taught the 3.(i) one.

There is one very good Java Applet where you can insert, delete, search etc. an element in different kinds of trees STEP-BY-STEP. Here’s the link:
Search Tree Java Applet
Enable Java in your browser to view it.

Advertisements

What do you think??

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s