Trading Space for Time: Tree to Vector

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

• Procedures are O(1).

• Space requirements are O(k).

• In a very sparse vector (k << |N|) this is a poor representational choice.

Previous slide

Next slide

Back to first slide

View graphic version