Answer: what? do you need any help, bc I can help with any question you have
Explanation:
Answer:
B.O(n).
Explanation:
Since the time complexity of visiting a node is O(1) in iterative implementation.So the time complexity of visiting every single node in binary tree is O(n).We can use level order traversal of a binary tree using a queue.Which can visit every node in O(n) time.Level order traversal do it in a single loop without doing any extra traversal.
Answer:
I believe the last 2 maybe even the one above the second to last answer
Explanation:
