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.
PSEUDOCODE:
1. DECLARE number: INTEGER
2. DECLARE multiple: INTEGER
3. INPUT number
4. FOR counter FROM 1 TO 10 DO
5. multiple <-- number * counter
6. PRINT number, " * ", counter, " = ", multiple
7. ENDFOR
<em>1. declaring a variable "number" as an Integer</em>
<em>2. declaring a variable "multiple" as an Integer</em>
<em>3. The user inputs the value of number</em>
<em>4. FOR loop where variable "counter" increments by 1 after every iteration</em>
<em>5. sets the value for variable "multiple" as the value of number * counter</em>
<em>6. prints out for example "3 * 1 = 3" and will continue till counter reaches 10</em>
<em>7. Ends the for loop</em>
FLOWCHART below
hope it helped
Answer:
<!-- Modified by selena ramirez - for html compliance -->
Explanation:
In HTML, <!-- .. --> tag is used to insert comments in the webpage code.
Comments written inside the tag is visible only on the code, and is not displayed in the browsers when the page is requested by the client computer.
<em>Comment tag</em> is useful when there is a lot of code and multiple developers are dealing with the same code.
Comments help developers understand what changed is made and why.
Answer:
downloads, websites, emails?