Computing Min on a Tree Machine

Computing Min on a Tree Machine

1

2

3

4

5

6

7

8

Step 3

3

1

2

5

1

2

1

Running Time: O(log n)

Previous slide

Next slide

Back to the first slide

View Graphic Version