Answer:
cybersecurity
Explanation:
it's either that or anti-spywhare but cybersecurity seems more likely
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.
C. The viewing area of a web browser.
The viewport is the user's visible area of a web page.
The toolbox contains software routines that developers use to create a consistent computer environment.