Binary Tree and Heap Quiz

What is the infix expression for the operation 1*2+3?

• 1+2*3

• 1*2+3

• 1+(2*3)

• (1*2)+3

In postfix notation, how is the expression (12*3)+4 represented?

• 12*3+

• 123*4+

• 12*3+4

• 12*34+

Which operator has the highest precedence?

• ^

• *

• -

• +

What is the left subtree of a binary search tree node supposed to contain?

• Only leaf nodes

• Duplicate nodes

• Nodes with keys lesser than the node’s key

• Nodes with keys greater than the node’s key

What happens when you try to insert a duplicate key in a binary search tree?

• It skips the insertion

• It throws an error

• It replaces the existing node

• It creates a new node

In a max-heap, what is true about the root node?

• It is always a leaf node

• It can be any value

• It contains the maximum value

• It contains the minimum value

What is the primary use of heaps?

• Implementing binary search trees

• Implementing priority queues

• Storing sorted data

• Creating expression trees

What is the result of deleting a node with two children in a binary search tree?

• It is removed without replacement

• It is replaced by its only child

• It is replaced by the largest node in the left subtree

• It is replaced by the smallest node in the right subtree

What is the correct pattern for converting postfix to infix?

• Operand, Operator, Operand

• Operator, Operand, Operand

• Operator, Operand, Operator

• Operand, Operand, Operator

Which of the following is a characteristic of a min-heap?

• The values decrease as you move down the tree

• The root node can be any value

• The root node contains the maximum value

• The values increase as you move down the tree