Question: 1. 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

1. 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: D, N, L H J, K. The numeric heap keys (the random numbers) are given in the following table. D 23 N 12 L 10 H 15 J20
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
