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.
Answer:
Es importante aprender a programar, por que es el mismo de que alguen aregle su carro. En estos tiempos, la technolagia se ha convertido en la nueva normal. Va vinir el tiempo quando nosotros necesitamos que arreglar un linia de codigo en nuestras computadoras, y no esta necesario para pagar alguen que ellos lo agan. Como quando necesitas que poner una llanta nueva a tu carro. Tu lo puedes cambiar solo. Entonses como el ejemplo del carro, tu puedes arreglar el linia de codigo en la computadora sin pagar alguen por acerlo.
Hi I would have to say B sorry if this answer is sucky but I'm trying my best to help you :D
Cache memory is a high-speed memory that stores the instructions and data that have been frequently accessed. It decreases the time it takes to decode the instructions stored in the instruction pipeline.
A. It decreases the time it takes to decode instructions stored in the instruction pipeline.
<u>Explanation:</u>
Whenever an instruction is invoked or some data is accessed, the CPU looks for it in the cache memory before accessing the main memory.
If the content is found in the cache memory, it accessed from there and then and hence the access time and decode time is reduced as there were no main memory lockups.
Given, a = 3, r = 1/2, n = 10
%r is common ratio
%n is number of terms
%a is the first term of the series
Sum = 0;
a = 3;
r = 1/2;
for i = 0 : 1 : 10;
Sum = Sum + a * r ^ i;
end
Sum
