I believe the answer is B. Optimization because it means to make work more efficient but I might be wrong. Checking definitions, this one seems more logical.
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.
A web application starts when a client sends a request to a server
Answer:
Wait for some time and reload the page
Fix the corrupted file
The file is deleted before finishing upload
Clear browser cache.
Explanation: