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: True
Explanation: "Ignore All" button is the button that operates when the user wants to ignore the word that is flagged .Flagged words are those which chosen by user to be banned and don't want to use in future.
Ignore all button helps in the ignoring of the spelling check of the words that the user is sure about and the words that user don't want to be the part of their content.This banning is for the future use and current time as well.Thus, the statement is true.
The correct answer is “C. The credit card number that you use to make an online purchase”
