Which data structure is used for implementing recursion?

• Stack

• Heat Maps

• Recursion Stack

• Queue

Answer explanation

The data structure required for Breadth First Traversal on a graph is?

• Stack

• Queue

• Array

• Trees

The prefix form of A-B/ (C * D ^ E) is?

• -A/B*C^DE

• -A/BC*^DE

• -ABCD*^DE

• -/*^ACBDE

Which of the following points is/are not true about Linked List data structure when it is compared with an array?

• Arrays have better cache locality that can make them better in terms of performance

• Random access is not allowed in a typical implementation of Linked Lists

• It is easy to insert and delete elements in Linked List

• Access of elements in linked list takes less time than compared to arrays

Which of the following is not the type of queue?

• Single ended queue

• Priority queue

• Circular queue

• Ordinary queue

Which of the following data structures can be used for parentheses matching?

• n-ary tree

• Queue

• Priority Stack

• Stack

What is an AVL tree?

• a tree which is balanced and is a height balanced tree

• a tree with three children

• a tree with atmost 3 children

• a tree which is unbalanced and is a height balanced tree

Which of the following statements about a binary search tree (BST) is FALSE?

• In a BST, the left subtree of a node contains only nodes with keys less than the node's key

• A BST can have duplicate values stored in its nodes.

• In a BST, the right subtree of a node contains only nodes with keys greater than the node's key.

• The inorder traversal of a BST visits the nodes in ascending order based on their keys

Minimum number of fields in each node of a doubly linked list is ________________

• Three

• Four

• Two

• None

A binary tree in which all its levels except

the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

• Threaded tree

• M-way search tree

• Full binary tree

• Complete binary tree