Trading Space for Time: List to Tree

• Given:

  • Data: N = {i : i < k}, k is known & fixed
  • Required procedures: sorted insert, delete, search

• Linked list: all procedures O(?), space O(?), where n = ?.

Previous slide

Next slide

Back to first slide

View graphic version