Duration: 7 minutes, 12 seconds
is a type of
self-balancing binary search tree
are used to implement
make use of
Insertion, deletion, and searching take
(log n) time in a
Binary search trees
Cormen, Thomas H., et al.
Introduction to Algorithms
. 2nd ed. Cambridge: MIT Press, 2001.
Feedback for this animation:
red-black tree, red-black properties, self-balancing binary search tree, self-balancing BST, balanced tree, balanced binary search tree, balanced BST, balanced binary tree, tree rotation, associative array, dictionary, map, hash, data structure, computer science animations, computer programming, Flash, learn computer science, study computer science
© 2008 - 2017 Bill Jacobs