adplus-dvertising
frame-decoration

Question

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

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

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is a weight balanced tree?

Similar Questions

Discover Related MCQs

Q. What are the applications of weight balanced tree?

Q. A node of the weight balanced tree has

Q. The size value of various nodes in a weight balanced tree are
leaf – zero

internal node – size of it’s two children

is this true?

Q. What are splay trees?

Q. Which of the following property of splay tree is correct?

Q. Why to prefer splay trees?

Q. Is it true that splay trees have O(logn) amortized complexity ?

Q. What is a splay operation?

Q. Which of the following options is an application of splay trees?

Q. When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

Q. What is the disadvantage of using splay trees?

Q. What is a threaded binary tree traversal?

Q. What are the disadvantages of normal binary tree traversals?

Q. What may be the content of a node in threaded binary tree?

Q. What are null nodes filled with in a threaded binary tree?

Q. The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?

Q. What are double and single threaded trees?

Q. In a max-heap, element with the greatest key is always in the which node?

Q. Heap exhibits the property of a binary tree?

Q. What is the complexity of adding an element to the heap.