Threaded Binary Tree MCQ

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

• What is inefficient with the below threaded binary tree picture?
  ক

  it has dangling pointers

  খ

  nothing inefficient

  গ

  incorrect threaded tree

  ঘ

  space is being used more
• What are double and single threaded trees?
  ক

  when both left, right nodes are having null pointers and only right node is null pointer respectively

  খ

  having 2 and 1 node

  গ

  using single and double linked lists

  ঘ

  using heaps and priority queues
• Which of the following tree traversals work if the null left pointer pointing to the predecessor and null right pointer pointing to the successor in a binary tree?
  ক

  inorder, postorder, preorder traversals

  খ

  inorder

  গ

  postorder

  ঘ

  preorder
• What are null nodes filled with in a threaded binary tree?
  ক

  inorder predecessor for left node and inorder successor for right node information

  খ

  right node with inorder predecessor and left node with inorder successor information

  গ

  they remain null

  ঘ

  some other values randomly
• In general, the node content in a threaded binary tree is ________
  ক

  leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

  খ

  leftchild_pointer, left_tag

  গ

  leftchild_pointer, left_tag, right_tag, rightchild_pointer

  ঘ

  leftchild_pointer, left_tag, data
• What are the disadvantages of normal binary tree traversals?
  ক

  there are many pointers which are null and thus useless

  খ

  there is no traversal which is efficient

  গ

  complexity in implementing

  ঘ

  improper traversals
• What is a threaded binary tree traversal?
  ক

  a binary tree traversal using stacks

  খ

  a binary tree traversal using queues

  গ

  a binary tree traversal using stacks and queues

  ঘ

  a binary tree traversal without using stacks and queues