Helsinki University of Technology
Laboratory of Information Processing Science
Tik-76.122 Data Structures and Algorithms
demo

Assignment 2 (2 points)

Create a binary search tree by inserting the elements from the item list into an initially empty tree. After inserting all items, delete the root node by dragging it into the place below. Thereafter complete the deletion in the tree by performing the actions as described in the deletion algorithm of the text book (section 4.3.5).

If there are equal keys, they are always inserted into the right branch of a node.

You can send an answer to this assignment at most 3 times.

Note if the tree does not fit on the screen, try to reduce the font size or expand the browser window horisontally and reload the assignment with the reload-button of the browser.