Data Structures and Algorithms

Introduction
Introduction to Algorithms Analysis
Recursion
Lists
- Implementation
- Linked List
  Nodes
  Iterator
  Template Singly Linked List
  Doubly Linked List
  Circular Linked List
Stacks
Queue
Tables
- Simple Table
- Hash Table
  Bucketing
  Chaining
  Linear Probing
  Quadratic Probing and Double Hashing
Sorting
Introduction to Trees, Binary Search Trees
AVL Trees
Red Black Trees
- Insertion Example
2-3 Trees
Graphs
- Representation
Complexity Theory
Appendix: Mathematics Review

Powered by GitBook

On this page

Was this helpful?

Binary Trees

PreviousTree Implementations NextBinary Search Trees

Last updated 4 years ago

A binary tree is a tree where every node has 2 subtrees that are also binary trees. The subtrees may be empty. The following is a binary tree:

Note that the term binary tree describes only the shape, it does not specify the ordering of values within the tree.

The following isn't (node with 2 has three subtrees):