Weight Balanced Tree MCQ

Test your knowledge with important Weight Balanced Tree MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Weight Balanced Tree MCQs at Bissoy

• Elements in a tree can be indexed by its position under the ordering of the keys and the ordinal position of an element can be determined, both with good efficiency.
  ক

  true

  খ

  false
• What does the below definations convey? i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1. ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.
  ক

  weight balanced and height balanced tree definations

  খ

  height balanced and weight balanced tree definations

  গ

  definations of weight balanced tree

  ঘ

  definations of height balanced tree
• Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as
  ক

  log2 n

  খ

  log4/3 n

  গ

  log3 n

  ঘ

  log3/2 n
• What are the operations that can be performed on weight balanced tree?
  ক

  all basic operations and set intersection, set union and subset test

  খ

  all basic operations

  গ

  set intersection, set union and subset test

  ঘ

  only insertion and deletion
• What is the condition for a tree to be weight balanced. where a is factor and n is a node? >= a*weight and weight >= a*weight. b) weight >= a*weight and weight >= a*weight. c) weight >= a*weight and weight >= a*weight. d) weight is a non zero
  ক

  weight >= a*weight and weight >= a*weight.

  খ

  n.left

  গ

  n.left

  ঘ

  n.left
• 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?
  ক

  true

  খ

  false
• A node of the weight balanced tree has
  ক

  key, left and right pointers, size

  খ

  key, value

  গ

  key, size

  ঘ

  key
• What are the applications of weight balanced tree?
  ক

  dynamic sets, dictionaries, sequences, maps

  খ

  heaps

  গ

  sorting

  ঘ

  storing strings
• What is a weight balanced tree?
  ক

  A binary tree that stores the sizes of subtrees in nodes

  খ

  A binary tree with an additional attribute of weight

  গ

  A height balanced binary tree

  ঘ

  A normal binary tree