Binary Tree Concepts Quiz

Which traversal method is most suitable for reconstructing a binary tree when combined with in-order traversal?

• Pre-order

• Post-order

• Level-order

• Any traversal

In an expression tree, what does each leaf node typically represent?

• An operator

• A variable or constant

• A mathematical function

• A group of sub-expressions

Which of the following is true about an operator node in an expression tree?

• It holds a variable

• It performs a computation on two child nodes

• It does not have children

• It only stores numeric values

What is typically stored in the internal (non-leaf) nodes of an expression tree?

• Constants

• Variables

• Operators

• Parentheses

Which of the following is an example of an expression tree for the expression (3+2)×5?

• The root is ×, with children + and 5.

• The root is +, with children 3 and 2.

• The root is +, with children × and 5.

• The root is ×, with children 3 and 2.

What type of binary tree is structured to maintain a sorted order?

• Full Binary Tree

• AVL Tree

• Binary Search Tree (BST)

• Complete Binary Tree

Which binary tree ensures the left and right subtrees of any node differ in height by at most 1?

• Red-Black Tree

• Complete Binary Tree

• AVL Tree

• Perfect Binary Tree

In a complete binary tree, all levels except possibly the last are...

• Completely empty

• Filled arbitrarily

• Completely filled from left to right

• In reverse order

What is a full binary tree?

• A binary tree where each level has exactly one node

• A binary tree with at least one child per node

• A binary tree where the root has no children

• A binary tree where every node has 0 or 2 children

What type of binary tree is used to implement heaps?

• Full Binary Tree

• AVL Tree

• Complete Binary Tree

• Red-Black Tree