Unit III Data Structures Quiz

What is a Tree ADT?

• A linear data structure

• A hierarchical non-linear data structure

• A queue-based structure

• A stack-based structure

Which traversal visits the root before its subtrees?

• Inorder

• Postorder

• Preorder

• Level order

Which tree traversal method visits left, root, then right?

• Preorder

• Inorder

• Postorder

• Breadth-first

In a postorder traversal, the sequence is:

• Root, Left, Right

• Left, Root, Right

• Left, Right, Root

• Right, Root, Left

What is the maximum number of nodes in a binary tree of height h?

• 2^h

• 2^h - 1

• h

• h^2

Which traversal is used to evaluate expression trees?

• Preorder

• Inorder

• Postorder

• Level order

What do the leaf nodes of an expression tree represent?

• Operators

• Operands

• Roots

• Traversals

What are typical applications of trees?

• Expression evaluation

• Hierarchical data representation

• File systems

• All of the above

Which of the following is true about Binary Search Trees (BST)?

• Left subtree values are less than root

• Right subtree values are greater than root

• No duplicate nodes

• All of the above

Time complexity to search in a balanced BST is:

• O(n)

• O(log n)

• O(n log n)

• O(1)