Binary Tree Iterator

Project information

Iterator pattern to iterate over a binary search trees.

Iteration runs in time O(L(x)) where L(x) is the length of the shortest path in the tree from x to x’s successor node.

Created on

April 15, 2022

Copy SSH clone URList-git@git.uwaterloo.ca:murtaza/binary-tree-iterator.git
Copy HTTPS clone URLhttps://git.uwaterloo.ca/murtaza/binary-tree-iterator.git