Read on Wikipedia

Image: Me (Intgr) · Public domain

Self-balancing binary search tree

Self-balancing binary search tree

Any node-based binary search tree that automatically keeps its height the same.

Epic
66 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

EpicTop 5%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 1,954

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 3,051 clicks on its links

  1. AVL tree

    Self-balancing binary search tree.

    24%

  2. Red–black tree

    Self-balancing binary search tree data structure.

    17%

  3. Binary search tree

    Rooted binary tree data structure.

    12%

  4. Treap

    Random search tree data structure.

    6.9%

  5. Hash table

    Associative array for storing key–value pairs.

    2.8%

  6. B-tree

    Tree-based computer data structure.

    0.82%

  7. Random binary tree

    Binary tree selected at random.

    0.79%

Readers come from

Share of the 1,872 readers arriving from another article

  1. Red–black tree

    Self-balancing binary search tree data structure.

    26%

  2. B-tree

    Tree-based computer data structure.

    16%

  3. AVL tree

    Self-balancing binary search tree.

    15%

  4. Binary search tree

    Rooted binary tree data structure.

    14%

  5. Binary tree

    Limited form of tree data structure.

    5%

  6. Hash table

    Associative array for storing key–value pairs.

    3.6%

  7. Linked list

    Data structure with nodes pointing to the next node.

    2.8%

  8. Tree sort

    Type of sorting algorithm.

    1.4%

  9. Dynamic array

    List data structure to which elements can be added/removed.

    1.1%

  10. Random access

    Computer memory concept.

    0.8%