coolest website ever! (for programmers) !!! Explantion added !!!

Toggle sidebar Toggle sidebar
A

Ameesh

Lifer
Apr 3, 2001
23,686
1
0
cool!


for some explantion:

red black trees are optimal search trees

no matter how many nodes you dd the hieght will always be as optimal as you can have, you might ask, why do i want an optimal hieght?

well when you are searching the tree your search time is dictated by how high your tree is so lower hieght is better.

a red black trees hieght is at worse 2*log(n+1) and can always be searched in O(log(n)) steps where n is the number of nodes in a tree. a normal binary tree has a worse case search time of O(n) steps soo you can see the great advantage of this tree!

 
Supermercado

Supermercado

Diamond Member
Jan 18, 2002
5,893
0
76
Ooooo. I haven't learned about red-black trees yet. Here's another applet that's kind of the same. One of my professors gave us this link to use when we were learning AVL trees and looking at the site now, it seems that they've updated the site to also include red-black trees. Was really helpful when learning AVL trees.
 

I have a book called DS&A in Java that has interactive applets of all the popular data structures and algorithms. Really help you to visualize it all.
 
rh71

rh71

No Lifer
Aug 28, 2001
52,844
1,049
126
This can easily be done in Flash. It is the greatest creative tool ever.
 
A

Ameesh

Lifer
Apr 3, 2001
23,686
1
0
Originally posted by: rh71
This can easily be done in Flash. It is the greatest creative tool ever.
Click to expand...

you sooo missed the point.



:cool: <-------- thats the point

this is you ----------> :confused:
 
B

bUnMaNGo

Senior member
Feb 9, 2000
964
0
0
damn red black trees... if it weren't for RB-delete, I would've gotten an A in my CS14 class :p good thing I'm done with algorithms... until grad school :Q
 
You must log in or register to reply here.

TRENDING THREADS

COMPANY
RESOURCES
FOLLOW
Top Bottom