Data Structures and Algorithms - Chapter 5: Binary Trees

# Binary Trees

## Introduction
A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child.

## Key Properties
- **Height**: The longest path from root to leaf
- **Depth**: The path from root to a specific node
- **Complete Binary Tree**: All levels filled except possibly the last

## Common Operations
1. **Insertion**: O(log n) for balanced trees
2. **Deletion**: O(log n) for balanced trees
3. **Search**: O(log n) for balanced trees
4. **Traversal**: O(n) for all nodes

## Types of Traversal
- **Inorder**: Left, Root, Right
- **Preorder**: Root, Left, Right
- **Postorder**: Left, Right, Root
- **Level-order**: Level by level