- ECE Home
- Undergraduate Studies
- Douglas Wilhelm Harder
- Algorithms and Data Structures Home
- Example Algorithms and Data Structures
- Sorting Algorithms
- Searching Algorithms
- Iterators
- Trees
- General Trees
- 2-3 Trees
- Skip Lists
- Quaternary Heaps
- Bi-parental Heaps
- Array Resizing
- Sparse Matrices
- Disjoint Sets
- Maze Generation
- N Puzzles using A* Searches
- Project Scheduling
- The Fast Fourier Transform
- String distances
- Matrix-chain Multiplications
- Inverse Square Root
- Newton Polynomials
- Random Trees
- Normal Distributions
- Splay Trees
- Leftist Heaps
- Skew Heaps
- Binomial Heaps
2-3 Trees
This is an implementation of 2-3 trees: a B tree with M = L = 3. As class names cannot begin with numbers, the class is called a B23_tree.
Currently, only insertion and printing work.
Algorithms and Data Structures
Department of Electrical and Computer Engineering
University of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
Department of Electrical and Computer Engineering
University of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
Website maintained by Douglas Wilhelm Harder