Homework problem I

Problem I

Assigned Oct 7, due Oct 21.

Red-Black Trees

  1. (5 points) CLR Exercise 13.3-2

    Show the red-black tree resulting from successive insertion of keys 41, 38, 31, 12, 19, 8 into an initially empty tree.

  2. (5 points) CLR Exercise 13.3-5

    Let T be the red-black tree formed by inserting n > 1 keys with RB-Insert. Argue that T has at least one red node.