Binary Search Tree Quiz No 3

Which traversal algorithm visits the root node first in a Binary Search Tree (BST)?

• In-order

• Pre-order

• Post-order

• Level-order

Which traversal method prints the nodes in ascending order in a BST?

• Pre-order

• In-order

• Post-order

• Level-order

What is the sequence of visiting nodes in a post-order traversal in a BST?

• Root, left subtree, right subtree

• Left subtree, right subtree, root

• Left subtree, root, right subtree

• Right subtree, left subtree, root

Which traversal method visits the nodes level by level, starting from the root?

• Pre-order

• In-order

• Post-order

• Level-order

In a pre-order traversal of a BST, what is the sequence of visiting nodes for the following tree:

• 10, 5, 3, 7, 15, 20

• 10, 5, 15, 3, 7, 20

• 10, 15, 20, 5, 7, 3

• 10, 5, 3, 7, 20, 15

Which traversal method can be used to create a copy of a BST?

• In-order

• Pre-order

• Post-order

• Level-order

In a post-order traversal of a BST, when is the root node visited?

• Before visiting the left subtree

• After visiting the left subtree and before the right subtree

• After visiting both the left and right subtrees

• Before visiting any subtree

Which traversal method is used to delete all nodes from a BST?

• Pre-order

• In-order

• Post-order

• Level-order

In which traversal method are nodes processed as they are encountered, starting from the root?

• Pre-order

• In-order

• Post-order

• Level-order

Which traversal method can be used to obtain elements in descending order from a BST?

• Pre-order

• In-order

• Post-order

• None of the above