B
Binary Tree Iterator
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.
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.