binary trees

Two-child node hierarchies

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

The structure resembles an upside-down tree, with the root at top and leaves at bottom.

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

datastructure

node

Connection point in networks

  • leafPlant's photosynthetic organ
  • rootUnderground absorbing structure
  • subtreeTree within tree

parent · child · sibling · depth · height · balanced · unbalanced · heap · ancestor · descendant

recursion

base case

Recursion's stopping condition

hierarchy

root

Underground absorbing structure

descendant · levels · depth · taxonomy · genealogy · organizational chart · classification · branching

algorithm

insertion

Placing something within

rotation · partition · backtracking · pathfinding · serialization

botany

branching

Splitting into separate directions

canopy · bifurcation · forking · dichotomous · arborescent · dendritic · root system · crown

traversal

preorder

Buy before availability

Opposites
data structure topology

binary treeslinked list

Sequential nodes with pointers

array · stack · queue · hash table · vector

branching factor

binary treestries

Makes an attempt

graph structure

binary treesarrays

Ordered element collections

graphs · networks · stacks · queues · sequences

Family

tree, nonbinary, binary, binomial, binaries, binarism, binary tree

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