Question 4 question.

R. Clayton (rclayton@monmouth.edu)
Thu, 10 Feb 2000 15:07:08 -0500 (EST)

• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
• Next message: R. Clayton: "Question 1 question."
• Previous message: R. Clayton: "Complexity references."

  In question #4 of homework 2, should we write code to insert and delete x
  from tree?

No; I don't want to see code for this answer, and I don't want to see just an
example. I want you to explain under which circumstances a red-black tree
remains unchanged when a node is added to the tree and then deleted from the
tree.

• Next message: R. Clayton: "Question 1 question."
• Previous message: R. Clayton: "Complexity references."

This archive was generated by hypermail 2.0b3 on Wed Apr 26 2000 - 09:35:05 EDT