Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 10
Which traversal finds the minimum depth of a binary tree fastest in practice?
A
In-order traversal
B
DFS visiting all nodes
C
Post-order traversal
D
BFS (level order), stopping at the first leaf