threaded binary trees

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

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

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

How to search for a key in a binary search tree?

• public Tree search(Tree root, int key) { if( root == null || root.key == key ) { return root; } if( root.key < key ) { return search(root.right,key); } else return search(root.left,key);

• public Tree search(Tree root, int key) { if( root == null || root.key == key ) { return root; } if( root.key < key ) { return search(root.left,key); } else return search(root.right,key); }

• public Tree search(Tree root, int key) { if( root == null) { return root; } if( root.key < key ) { return search(root.right,key); } else return search(root.left,key);

• public Tree search(Tree root, int key) { if( root == null) { return root; } if( root.key < key ) { return search(root.right.right,key); } else return search(root.left.left,key);

What is the speciality about the inorder traversal of a binary search tree?

• a) It traverses in a non increasing order

• b) It traverses in an increasing order

• c) It traverses in a random fashion

• d) It traverses based on priority of the node

What does the following piece of code do?

public void func(Tree root)

{

func(root.left());

func(root.right());

System.out.println(root.data());

}

• a) Preorder traversal
  
  
  

• b) Inorder traversal

• c) Postorder traversal

• d) Level order traversal

1. Which of the following is false about a binary search tree?

• a) The left child is always lesser than its parent

• b) The right child is always greater than its parent

• c) The left and right sub-trees should also be binary search trees

• both a and b are correct

The number of edges from the root to the node is called __________ of the tree.

• a) Height

• b) Depth

• c) Length

• d) Width

What is a full binary tree?

• a) Each node has exactly zero or two children

• b) Each node has exactly two children

• c) All the leaves are not at the same level

• d) Each node has exactly one or two children

What is a complete binary tree?

• a) Each node has exactly zero or two children

• b) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

• c) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

• d) A tree In which all nodes have degree 2