Assignment Quiz-2

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

In binary trees, which traversal visits the left subtree, then the root, and finally the right subtree recursively?

• Preorder traversal

• Postorder traversal

• Level order traversal

• Inorder traversal

Consider a singly linked list with nodes containing integers. Which operation typically has a time complexity of O(1) for both insertion and deletion?

• Insertion at the beginning of the list

• Deletion from the middle of the list

• Deletion from the end of the list

• Insertion at the end of the list

Example of non linear data structure

• array

• tree

• queue

• stack

struct node *current = start->next

what will "current" contain if it is a pointer to a variable of type struct node ?

• Address of 2nd Node

• Data Field of 2nd Node

• Address of 1st Node

• None of these

What is the operation of the below statements?

• Insert a new node to the front of a linked list

• Create a new node for a linked list

• Insert a new node to the end of the linked list

• Calculate the size of a linked list