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