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.
Automation is/are the replacement of human operation and control of machinery with some form of programmed control. Thank you for posting your question here at brainly. I hope the answer will help you. Feel free to ask more questions here.
Motion is the movement of a body part or an object
Answer:
E-book : online edition of a new novel .
e-zine:online issue of today’s newspaper.
Online reference: online encyclopedia
blog: online website that posts restaurants reviews
Explanation:
Are you doing edge?
Also pleaseeeeeeeeeeeeeeeeeee mark me brainliest.
Answer:
Following is the program in C++ Language
#include <iostream> // header file
using namespace std; // namespace std
int main() // main method
{
int n; // variable declaration
cout<<" Please enter the number :";
cin>>n; // Read the number
if(n>0) // check the condition when number is positive
{
cout<<n<<endl<<"The number is Positive"; // Display number
}
else if(n<0) // check the condition when number is Negative
{
cout<<n<<endl<<"The number is Negative";// Display number
}
else // check the condition when number is Zero
{
cout<<n<<endl<<"The number is Zero";// Display number
}
return 0;
}
Output:
Please enter the number:
64
The number is Positive
Explanation:
Following are the description of the program
- Declared a variable "n" of int type.
- Read the value of "n" by user.
- Check the condition of positive number by using if block statement .If n>0 it print the number is positive.
- Check the condition of negative number by using else if block statement If n<0 it print the number is negative.
- Finally if both the above condition is fail it print the message " The number is Zero"
