COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
A Balanced Tree has equal number of items on each subtree.
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -A tree is perfectly height-balanced if the left and right subtrees of any node are the same height.
Detailed explanation-2: -height balanced trees wont convey weight balanceness but opposite can be true.
Detailed explanation-3: -Which of the following tree data structures is not a balanced binary tree? Explanation: All the tree data structures given in options are balanced, but B-tree can have more than two children.
There is 1 question to complete.