Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Lec 10 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
21,261
Loading...
Alert icon
Sign in or sign up now!
Alert icon
There is no Interactive Transcript.

Uploaded by on Jan 7, 2009

Lecture 10: Red-black Trees, Rotations, Insertions, Deletions

View the complete course at: http://ocw.mit.edu/6-046JF05

License: Creative Commons BY-NC-SA

More information at http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

Category:

Education

License:

Standard YouTube License

  • likes, 2 dislikes

Link to this comment:

Share to:

Top Comments

  • its 530 pm on wednesday

  • Red nodes should be single circle- and black should have double circles- Because R in red has one circle and B in Black has 2 circles- :)

see all

All Comments (15)

Sign In or Sign Up now to post a comment!
  • No Deletions in this lecture

  • nice...where is the video of the recitation class?

  • wonderful and answer lots of questions which I can not understand by myself reading~

  • wonderful and answer lots of questions which I can not understand by myself reading~

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more