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.
I think it’s swipe up if i’m correct, if not sorry
Answer:
the teacher said a (dash) reads pages on website pls answer me now i have to write it now
B) false, as you want them to be as simple as you can... the 'wordy' part comes underneath said title :)
Yes true
hey is this one of your questions on a science packet if so it is called explore ring Earth's surface because I have the same packet with the same question on it
