Browse•Categories•Random

Self-balancing binary search tree

Duration: 1 minute, 58 seconds
Related Topics:
  • Self-balancing binary search trees often make use of tree rotations.
  • A red-black tree is a type of self-balancing binary search tree.
  • Insertion, deletion, and searching take O(log n) time in some types of self-balancing binary search trees.
Category:
Binary search trees
References:
Tags: 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

Home•About•Links

© 2008 - 2024 Bill Jacobs