Binary tree

In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary tree where k = 2. A recursive definition using set theory is that a binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton (a single–element set) containing the root.

Back to Data Structures →

Source: Wikipedia · Image: Wikimedia Commons · CC BY-SA 4.0

ALGOHAY

Algorithms, demystified — data-structure guides, complexity tools, and interview prep for developers.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every algorithm, image, fact, and figure in the museum is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.