binary tree

Two-child node hierarchy

A binary tree is a data structure in computer science where each node has at most two children, typically called left and right.

The structure branches downward like an inverted tree, with a single root node at the top.

Binary trees enable efficient searching, sorting, and hierarchical organization of data: The algorithm traverses the binary tree to find the smallest value.

structural

node

Connection point in networks

  • rootUnderground absorbing structure
  • leafPlant's photosynthetic organ
  • parentMother or father

child · sibling · subtree · branch · depth · height · level · edge · path · ancestor

algorithmic

traversal

Act of moving through

balancing · rotation · depth-first · breadth-first · preorder · sorting · pruning · splitting · merging · rebalancing

hierarchical

hierarchy

Ranked authority structure

  • taxonomyScience of categorical arrangement
  • structureArrangement of interconnected parts
  • levelsHeights or ranked stages

organization · classification · nesting · parent-child · rank · order · tiered · layered · subordinate · directory

variants

heap

Jumbled collection of items

Categories
Opposites
data structure topology

binary treelinked list

Sequential nodes with pointers

array · stack · queue · hash table · vector

branching factor

binary treeB-tree

Self-balancing tree structure

Family

bit, tree, trees, binary, arboretum, arboreal, byte, binomial, arborist

Familiarity
Top 500,000
Profile
Used worldwide · Timeless · Rated G