Data Structures & Algorithm Quiz final

What is a linear data structure?

• A data structure where elements are not arranged sequentially

• A data structure where elements are arranged sequentially

• A data structure where elements are attached in a hierarchically manner

• A data structure where elements are arranged in a hierarchical structure

Which traversal visits the current node before visiting any nodes inside the left or right subtrees?

• Level-order Traversal

• Inorder Traversal

• Postorder Traversal

• Preorder Traversal

What is the maximum number of nodes that can be inserted in any binary tree of height 'h'?

• 2h-1

• 2h

• 2h+1-1

• 2h+1

How is a binary tree represented using a doubly linked list?

• Each node has four fields for storing left and right child addresses

• Each node has one field for storing data and two fields for storing left and right child addresses

• Each node has three fields for storing left child, data, and right child addresses

• Each node has two fields for storing left and right child addresses

What is the purpose of converting a general tree into a binary tree?

• To complicate the structure of the tree

• To increase the number of references for each node

• To simplify algorithms for searching, traversing, adding, and deleting nodes

• To reduce the number of fields used for references

Which type of binary tree has every node with exactly two children or none?

• Extended Binary Tree

• Almost Complete Binary Tree

• Perfect Binary Tree

• Strictly Binary Tree

What is the process for traversing a binary tree using Depth-First Search (DFS) algorithm?

• Level-wise traversal from left to right

• Root - Left Child - Right Child traversal

• Left Child - Right Child - Root traversal

• Left Child - Root - Right Child traversal

How is a binary tree traversed using Breadth-First Search (BFS) algorithm?

• Traverse nodes level-by-level and left-to-right

• Visit the current node after visiting all the nodes of the left and right subtrees

• Visit the current node after visiting all nodes inside the left subtree but before visiting any node within the right subtree

• Visit the current node before visiting any nodes inside the left or right subtrees

What is the main use of expression trees?

• To implement BFS traversal

• To find the height of a tree

• To compress data using Huffman Coding

• To evaluate, analyze, and modify expressions

What is the purpose of Huffman Coding?

• To compress data without losing details

• To implement DFS traversal

• To find the height of a tree

• To create expression trees