Understanding Binary Trees and Insertion

Which of the following is a property of a binary tree?

• Each node has at most three children.

• Each node has at most two children.

• Each node has exactly two children.

• Each node has at least one child.

Which of the following is not a tree traversal method?

• In-order

• Pre-order

• Post-order

• Reverse-order

What is the first step in inserting a node into a binary search tree?

• Compare the node with the root.

• Insert the node at the root.

• Traverse to the leftmost node.

• Traverse to the rightmost node.

Which of the following is an application of binary trees?

• Network routing

• Sorting algorithms

• Expression parsing

• All of the above

In a binary search tree, where is the smallest element located?

• Rightmost node

• Leftmost node

• Root node

• Any leaf node

What is the main advantage of using a binary search tree over a linked list?

• Faster insertion

• Faster search

• Easier to implement

• Uses less memory

Which of the following is not a characteristic of a binary search tree?

• Left subtree contains nodes with keys less than the root.

• Right subtree contains nodes with keys greater than the root.

• All nodes have two children.

• In-order traversal results in sorted order.

What is the result of performing a post-order traversal on a binary tree?

• Root, Left, Right

• Left, Right, Root

• Right, Root, Left

• Left, Root, Right