50+ Threaded Binary Tree MCQs with FREE PDF

We have the best collection of Threaded Binary Tree MCQs and answer with FREE PDF. These Threaded Binary Tree MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Threaded Binary Tree MCQs

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

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

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

c) they remain null

d) some other values randomly

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

2. 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?

a) inorder, postorder, preorder traversals

b) inorder

c) postorder

d) preorder

Answer: inorder, postorder, preorder traversals

3. What are double and single threaded trees?

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

b) having 2 and 1 node

c) using single and double linked lists

d) using heaps and priority queues

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

4. What is wrong with below code for inorder traversal of inorder threaded binary tree:

inordertraversal(threadedtreenode root):
   threadedtreenode q = inorderpredecessor(root)
   while(q!=root):
   q=inorderpredecessor(q)
   print q.data

a) inordersuccessor instead of inorderpredecessor must be done

b) code is correct

c) it is code for post order

d) it is code for pre order

Answer: inordersuccessor instead of inorderpredecessor must be done

5. What is a threaded binary tree traversal?

a) a binary tree traversal using stacks

b) a binary tree traversal using queues

c) a binary tree traversal using stacks and queues

d) a binary tree traversal without using stacks and queues

Answer: a binary tree traversal without using stacks and queues

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

a) there are many pointers which are null and thus useless

b) there is no traversal which is efficient

c) complexity in implementing

d) improper traversals

Answer: there are many pointers which are null and thus useless

7. In general, the node content in a threaded binary tree is

a) leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

b) leftchild_pointer, left_tag

c) leftchild_pointer, left_tag, right_tag, rightchild_pointer

d) leftchild_pointer, left_tag, data

Answer: leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

Threaded Binary Tree MCQs PDF Download

50+ Binary Trees using Array MCQs with FREE PDF
50+ Binary Trees using Linked Lists MCQs with FREE PDF
50+ Binary Tree Operations MCQs with FREE PDF
50+ Preorder Traversal MCQs with FREE PDF
50+ Postorder Traversal MCQs with FREE PDF
50+ Inorder Traversal MCQs with FREE PDF
50+ Binary Tree Properties MCQs with FREE PDF
50+ Binary Search Tree MCQs with FREE PDF
50+ Balanced Binary Tree MCQs with FREE PDF
50+ Self Balancing Binary Search Tree MCQs with FREE PDF
50+ Randomized Binary Search Tree MCQs with FREE PDF
50+ AA Tree MCQs with FREE PDF
50+ AVL Tree MCQs with FREE PDF
50+ Cartesian Tree MCQs with FREE PDF
50+ Weight Balanced Tree MCQs with FREE PDF
50+ Red Black Tree MCQs with FREE PDF
50+ Top Tree MCQs with FREE PDF
50+ Splay Tree MCQs with FREE PDF
50+ Treap MCQs with FREE PDF
50+ Tango Tree MCQs with FREE PDF
50+ Rope MCQs with FREE PDF

Comments