Software Engineering KB

Home

❯

01 Foundations

❯

00 Data Structures

❯

01 Concept

❯

Binary Trees

Binary Trees

Feb 10, 20261 min read

  • data-structures
  • trees
  • binary-trees

Binary Trees

← Back to Tree Structures

Tree where each node has at most two children (left and right). The basis for many more specialized tree structures. Understanding traversals is fundamental.

Key Properties

  • In-Order Traversal
  • Pre-Order Traversal
  • Post-Order Traversal
  • Level-Order Traversal

Related

  • Binary Search Trees (ordered variant)
  • Heaps (complete binary tree)
  • Segment Trees and Fenwick Trees

data-structures trees binary-trees


Graph View

  • Binary Trees
  • Key Properties
  • Related

Backlinks

  • Tree Structures
  • Binary Search Trees
  • Segment Trees and Fenwick Trees
  • In-Order Traversal
  • Level-Order Traversal
  • Post-Order Traversal
  • Pre-Order Traversal

Created with Quartz v4.5.2 © 2026

  • GitHub