Data Structures and Algorithms

main

main Primary version

Data Structures and Algorithms
Algorithms Analysis
Recursion
Lists
- Implementation
- Linked List
  Concepts
  Implementation - List and Nodes
  Implementation - push_front(), pop_front()
  Implementation - Iterators
  Modification - Sentinel Nodes
Stacks and Queues
- Stack Implementation
- Queue Implementation
Table
- A Simple Implementation
- Hash Tables
  Bucketing
  Chaining
  Linear Probing
Sorting
Trees
AVL Trees
Red Black Trees
2-3 Trees
Graphs
Introduction to Computational Theory
Appendix: Markdown
Appendix: Mathematics Review

Powered by GitBook

On this page

Binary Trees

PreviousTrees NextBinary Search Trees

Last updated 3 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)