Exploring Binary Trees Quiz

Which of the following is a method of binary tree traversal?

• Depth-First Search

• Breadth-First Search

• Inorder Traversal

• Linear Search

In a binary tree, each node has at most how many children?

• 1

• 2

• 3

• 4

Which of the following is true for a Binary Search Tree (BST)?

• All nodes have two children

• Left subtree contains only nodes with keys less than the node's key

• Right subtree contains only nodes with keys greater than or equal to the node's key

• It is a complete binary tree

Which traversal method is used to get the nodes of a binary search tree in non-decreasing order?

• Preorder

• Inorder

• Postorder

• Level Order

Which of the following is an application of binary trees?

• Sorting algorithms

• Network routing

• Expression parsing

• All of the above

In a binary tree, the level of the root node is:

• 0

• 1

• 2

• 3

Which of the following is a correct representation of a binary tree?

• Linked List

• Array

• Graph

• Both A and B

In a binary search tree, which node is visited first in a preorder traversal?

• Left child

• Right child

• Root node

• Leaf node

Which of the following is a disadvantage of using binary trees?

• Inefficient for sorted data

• Requires more memory than arrays

• Complex to implement

• All of the above

What is the height of a binary tree with a single node?

• 0

• 1

• 2

• -1