Which of the Following Statements About Breadth-First and Depth-First Traversal

question 97

Multiple Choice

Which of the following statements about breadth-first and depth-first traversal is NOT correct?

• A)Depth-first search goes deeply into the tree and then backtracks when it reaches the leaves.
• B)Breadth-first and depth-first search only work on a binary tree.
• C)Breadth-first search first visits all nodes on the same level before visiting the children.
• D)Depth-first search uses a stack to track the nodes that it visits.

---

Definitions:

Diagnosis Code

A code used in healthcare to classify and document diseases, disorders, symptoms, and medical conditions.

Alphabetic Index

An organized list of items, words, or names sorted in alphabetical order.

Fractured Tibia

A break in the tibia bone, located in the lower leg, which can vary in severity and may impact mobility and require medical treatment.

Table of Drugs

A compilation or list organized to provide information about various medications, including uses, dosages, and side effects.