1.Suppose a complete binary tree has _______ items. In theworst case time, how m

Question

1.Suppose a complete binary tree has _______ items. In theworst case time, how many items would be examined by thesearch? a)7____b)15_____c)31_____d)63______e)13______f)22_______g)32______h)k 2.Suppose that a full binary tree has _______ levels. Inthe worst case time, how many items would be examined by thesearch? a)4____b)5_____c)6_____d)k______ 1.Suppose a complete binary tree has _______ items. In theworst case time, how many items would be examined by thesearch? a)7____b)15_____c)31_____d)63______e)13______f)22_______g)32______h)k 2.Suppose that a full binary tree has _______ levels. Inthe worst case time, how many items would be examined by thesearch? a)4____b)5_____c)6_____d)k______ a)4____b)5_____c)6_____d)k______

Explanation / Answer

1.Suppose a complete binary tree has _______ items. In theworst case time, how many items would be examined by thesearch? a)7____3 b)15_____4 c)31_____5 d)63______6 e)13______3 f)22_______2 g)32______6 h)k               Ceil( lg (k+1))                     //here ceil is the ceiling function. 2.Suppose that a full binary tree has _______ levels. Inthe worst case time, how many items would be examined by thesearch? a)4____4 b)5_____5 c)6_____6 d)k______k a)4____4 b)5_____5 c)6_____6 d)k______k

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.