Question: 2. Construct a treap with alphabetic key and numeric min-heap order. You are to insert the items one at a time and show the treap

2. Construct a treap with alphabetic key and numeric min-heap order. You are to insert the items one at a time and show the treap after each rotation. Insert letters in this order: A, B, C, D, E, F. The numeric heap keys (the random numbers) are given in the following table. A 23 B112 C 11
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
