The traversal of a binary tree is ______.
A)O(n)
B)O(1)
C)O(n²)
D)O(log2ⁿ)

Name: The traversal of a binary tree is ______. A)O(n) B)O(1) C)O(n²) D)O(log2ⁿ)
Brand: Quizplus
Rating: 4.7 (28 reviews)

Question

Quizplus · Accepted Answer

The traversal of a binary tree requires visiting each node once, so the time complexity is proportional to the number of nodes in the tree, which is O(n) in the worst case. The other options are not appropriate for the traversal of a binary tree.

The Traversal of a Binary Tree Is ______