Answer:
Let the function be Node* ins(Node *root,int k)
if root node is NULL then return new node with data equal to k.
If the k <root->data
root->left=ins(root->left,k);
else if k >root->data
root->right =ins(root->right,k);
At last return root.
Explanation:
Node is always inserted at the at the leaf node.We will search k in the tree if we hit a the leaf node the new node is inserted as the child of the leaf node.
Class B would be the correct answer.
Answer:
D. Prepare the content
Explanation:
Before Jennifer starts designing the website she has to prepare content for the website
Answer:
class OddNumber
{
public static void main(String args[])
{
int n = 1000; //Store 1000 in Variable n typed integer
System.out.print("Odd Numbers from 1 to 1000 are:"); // Print headline of output window
for (int i = 1; i <= n; i++) //For loop to go through each number till end
{
if (i % 2 != 0) //check if number is even or odd.Not divisible by 2 without reminder means it is odd number
{
System.out.print(i + " "); //print odd numbers
}
}
}
}
