Binary Tree

noun

say it: “BY-nuh-ree TREE” /ˈbaɪnəri triː/

A tree where every node has at most two children, a left one and a right one.

What is a binary tree?

A binary tree is a tree where each node has at most two children: a left child and a right child. Binary search trees and heaps are both binary trees, with different rules about what goes where.

In a sentence

  • “A heap and a binary search tree are both kinds of binary tree, with different rules about what goes where.”

Level: Apprentice · More Data Structures terms at this level

Updated