Answer:
The detail answer to this question is given in the explanation section.
The correct answer is .info
Explanation:
Let look as each statement
p.info.important
this is a specific because it says
go to important property which is inside info property which is inside P
.info is less specific
because it will go to .info No function is given whose property is this.
p.info
This is some what specific. As it says select .info property which is inside p
First four tasks = 8 seconds
Next four tasks = 8 seconds
Last two tasks = 8 seconds
The total number of seconds to perform all tasks is 24 seconds.
The throughput, which would be the number of tasks per second, is calculated by taking the number of tasks and dividing by the number of seconds:
10 tasks / 24 seconds = 5/12 or 0.4167 tasks per second
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.
