Treap Insert

• Choose a random priority

• Insert as in normal BST

• Rotate up until heap order is restored

6

7

insert(15)

7

8

2

9

15

12

6

7

7

8

2

9

15

12

9

15

6

7

7

8

2

9

9

15

15

12

Previous slide

Next slide

Back to first slide

View graphic version