Re: Problem with RB trees

From: Nicholas King <zeddie@xxxxxxxxxxxxxxxx>
Date: Mon, 18 Jun 2007 10:52:24 +1000

Alexei R. wrote:

Hi all, i'm hopeless, i need to do a red black tree , to solove the
dictionary problem. and i need insert and delete in O(1) (it's easy:
lazy deletion), insert O(1), find worst case O(nlogn). amortized all
O(logn).

thanks.

Oooh smells like homework.

Ask your lecturer and tutor for advice and read your textbook.

Cheers
Nicholas King
.

References:
- Problem with RB trees
  - From: Alexei R.

Prev by Date: Problem with RB trees
Next by Date: Re: Finding longest path between two vertices
Previous by thread: Problem with RB trees
Index(es):
- Date
- Thread