Balanced Binary Tree MCQ

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

• The figure shown below is a balanced binary tree. If node P is deleted, which of the following nodes will get unbalanced?
  ক

  U

  খ

  M

  গ

  H

  ঘ

  A
• AVL trees are more balanced than Red-black trees.
  ক

  True

  খ

  False
• Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
  ক

  insertion takes less time

  খ

  deletion takes less time

  গ

  searching takes less time

  ঘ

  construction of the tree takes less time than binary heap
• Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.
  ক

  O(m+n)

  খ

  O(mn)

  গ

  O(m)

  ঘ

  O(mlog n)
• Which of the following data structures can be efficiently implemented using height balanced binary search tree?
  ক

  sets

  খ

  priority queue

  গ

  heap

  ঘ

  both sets and priority queue
• Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.
  ক

  O(log n)

  খ

  O(nlog 2)

  গ

  O(n)

  ঘ

  O(1)
• A binary tree is balanced if the difference between left and right subtree of every node is not more than ____
  ক

  1

  খ

  3

  গ

  2

  ঘ

  0
• Figure below is a balanced binary tree. If a node inserted as child of the node R, how many nodes will become unbalanced?
  ক

  2

  খ

  1

  গ

  3

  ঘ

  0
• The balance factor of a node in a binary tree is defined as _____
  ক

  addition of heights of left and right subtrees

  খ

  height of right subtree minus height of left subtree

  গ

  height of left subtree minus height of right subtree

  ঘ

  height of right subtree minus one
• What will be the height of a balanced full binary tree with 8 leaves?
  ক

  8

  খ

  5

  গ

  6

  ঘ

  4