Binary Search Tree Quiz No 1

What traversal method explores the left subtree before the right subtree in a binary tree?

• Pre-order

• In-order

• Post-order

• Level-order

Which traversal method starts with the root node, then visits the left subtree, and finally the right subtree?

• Pre-order

• In-order

• Post-order

• Level-order

In a binary search tree, which traversal method results in a sorted sequence of nodes?

• Pre-order

• In-order

• Post-order

• Level-order

What is the maximum number of children a node can have in a binary tree?

• 0

• 1

• 2

• 3

What is the height of a perfectly balanced binary search tree (BST) with 15 nodes?

• 3

• 4

• 5

• 6

Which traversal method explores the right subtree before the left subtree in a binary tree?

• Pre-order

• In-order

• Post-order

• Level-order

Which of the following traversal methods visits the root node after its children in a binary tree?

• Pre-order

• In-order

• Post-order

• Level-order

In a post-order traversal of a binary tree, in what order are nodes visited?

• Root -> Left -> Right

• Left -> Right -> Root

• Left -> Root -> Right

• Root -> Right -> Left

Which traversal method is useful for deleting all nodes in a binary tree?

• Pre-order

• In-order

• Post-order

• Level-order

In a binary search tree, what property must be maintained to ensure nodes are arranged in a sorted order during an in-order traversal?

• All nodes have exactly two children.

• Each node has a unique value.

• The left child of a node is less than the node, and the right child is greater than the node

• The height of the tree is fixed.