Trading Space for Time: Tree to Vector

• Vector , V[0...k] such that V[i]=1 iff i ? N.

• Procedures are O(?).

• Space requirements are O(?).

Previous slide

Next slide

Back to first slide

View graphic version