Self-balancing binary search tree Guide, Meaning , Facts, Information and Description

In computing, a self-balancing binary search tree is a binary search tree that attempts to keep its height, or the number of level of nodes beneath the root, as small as possible at all times, automatically. This is important, because most operations on a binary search tree take time proportional to the tree's height, and ordinary binary search trees can attain very large heights in rather ordinary situations, such as when the keys are inserted in order. Keeping the height small is usually accomplished by performing transformations on the tree, such as tree rotations, at key times.

Times for various operations in terms of number of nodes in the tree n:

Operation	Big-O time
Lookup	O(log n)
Insertion	O(log n)
Removal	O(log n)
In-order iteration	O(n)

For some implementations these times are worst-case, while for others they are amortized.

Popular data structures implementing this type of tree include

• AVL tree
• B-Tree
• red-black tree
• splay tree

This is an Article on Self-balancing binary search tree. Page Contains Information, Facts Details or Explanation Guide About Self-balancing binary search tree

	Web www.E-paranoids.com