Binary Search Tree Priority Q Data Structure (that’s a mouthful)

4

12

10

6

2

11

5

8

14

13

7

9

insert:

deleteMin:

Previous slide

Next slide

Back to first slide

View graphic version