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.
<span>C. when listing items that have an order of priority
</span>
Answer:
Spoofing
Explanation:
Spoofing that occurs when an intruder computer fools network into believing its IP address is associated with trusted source
The answer to that is a Pixel
