Data structures whose records are arranged as a hierarchy of nodes, each node holding a key and links to the nodes beneath it. The group includes the binary search tree, which keeps keys in order so a value can be found by repeated halving, the self-balancing AVL and red-black trees that keep the hierarchy from growing lopsided as items are added, and the binary heap, a tree arranged so that the largest or smallest item is always at the top.
Browse By
Tree Data Structures
Filter Results6 entries
Sources
Free On-line Dictionary of Computing: B-Tree
Free On-line Dictionary of ComputingHas Member: B-Tree, Dictionary entryQuote, Has Member: B-Tree, Dictionary entry
A multi-way balanced tree
Abstract syntax tree, Wikipedia
Has Member: Abstract Syntax Tree, LeadQuote, Has Member: Abstract Syntax Tree, Lead
It is a tree representation of the abstract syntactic structure of text
Wikipedia: Binary search tree
Wikimedia FoundationHas Member: Binary Search Tree, LeadQuote, Has Member: Binary Search Tree, Lead
In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.
Wikipedia: AVL tree
Wikimedia FoundationHas Member: AVL Tree, LeadQuote, Has Member: AVL Tree, Lead
In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree.
Wikipedia: Red-black tree
Wikimedia FoundationHas Member: Red-Black Tree, LeadQuote, Has Member: Red-Black Tree, Lead
In computer science, a red-black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information.
Binary heap, Wikipedia
Has Member: Heap, LeadQuote, Has Member: Heap, Lead
A binary heap is a heap data structure that takes the form of a binary tree.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.