binary tree

A tree in which every node has at most two children, called the left child and the right child.

In more detail

The course represents one with a Node class holding a value and two optional references, left and right. Binary search trees, AVL trees and heaps are all binary trees with extra rules. Most binary-tree algorithms are short recursive functions that handle a node and recurse into its two children.

Related terms

Taught in

References