· Say you set the key for each position p of a binary tree T equal to its pre-order rank. Under what circumstances is T a heap? In other words, what property should T have to be a heap? Discuss about such a property.
· If we are to insert "43," "18," and "2," on the binary tree shown below (it's also a heap!), what is the end result? Remember we need three steps to complete inserting in a heap: a) Place the new element in the next available p
0 sold
Other
/
Other
Other
/
Other
08 Dec 2020