QUESTION 7 5 po The Height-Balance Property states that for every internal posit

Question

QUESTION 7 5 po The Height-Balance Property states that for every internal position, p, of a binary search tree, T, the heights of the children of p differ by at most Any binary search tree, T, that satisfies this property is said to be a(n) 3 poir QUESTION 8 A heap storing n keys has a height of O o(log n O o(n) O(n O O(n log n) 3 point QUESTION 9 In a heap, last node is always: O The root The node with the smallest key value The rightmost node of maximum depth The last node can be any arbratary node

Explanation / Answer

Answer is as follows:

a) The height balance property states that for every that for every internal position p of an binary search tree T the heights of Children of p be differ by atmost 1 from each other. And any binary search tree that satisfy this property is said to be AVL tree.

b) The Correct Option is a

i.e. O(log n)

c) In heap the last node is any arbratary node that are arranged on the basis of node values.

So the correct Option is D

if there is any query please ask in comments...

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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