Exercise 4: Binary Search Trees

A red-black tree is an example of a binary search tree. Explain why your assigned operation below is efficient in a binary search tree (topics were assigned via random number generator):

• adding a value (Vinci)
• searching for a value (Neil)
• traversing the tree in sorted order (Zhihui)

Recall that binary search trees were covered in Data Structures and Algorithms. There is a chapter in your Algorithms book addressing some of these topics, though it was not assigned for reading.

After you post, you may view other students' answers and reply with additional information or corrections to their topics (encouraged).

Initial post is due by Friday (4/12). Any additional replies by Sunday (4/14).