+1 vote
in Data Structures & Algorithms I by (110k points)
What is a weight balanced tree?

(a) A binary tree that stores the sizes of subtrees in nodes

(b) A binary tree with an additional attribute of weight

(c) A height balanced binary tree

(d) A normal binary tree

My question is based upon Weight Balanced Tree topic in portion Binary Trees of Data Structures & Algorithms I

This question was addressed to me in quiz.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Correct answer is (a) A binary tree that stores the sizes of subtrees in nodes

The explanation is: Unlike AVL and redblack trees which uses height and color as book keeping information, weight balanced trees use the size of subtrees.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...