B-Tree Test - Sanfoundry

1. What are double and single threaded trees?

using heaps and priority queues

using single and double linked lists

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

having 2 and 1 node

2. What is a threaded binary tree traversal?

a binary tree traversal using queues

a binary tree traversal without using stacks and queues

a binary tree traversal using stacks and queues

a binary tree traversal using stacks

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

leftchild_pointer, left_tag, right_tag, rightchild_pointer

leftchild_pointer, left_tag, data

leftchild_pointer, left_tag, data, right_tag, rightchild_pointer

leftchild_pointer, left_tag

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

there is no traversal which is efficient

complexity in implementing

improper traversals

there are many pointers which are null and thus useless

5. 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

inorder, postorder, preorder traversals

postorder

preorder

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

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

they remain null

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

some other values randomly

7. What is inefficient with the below threaded binary tree picture?

it has dangling pointers

incorrect threaded tree

space is being used more

nothing inefficient

8. 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

it is code for pre order

inordersuccessor instead of inorderpredecessor must be done

code is correct

it is code for post order