Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>
Answer:
The program in Python is as follows:
qty = int(input("Quantity: "))
price = 100 * qty
if qty >1000:
price = (100 - 0.10 * 100) * qty
print("Cost: "+str(price))
Explanation:
This prompts the user for the quantity
qty = int(input("Quantity: "))
This calculates the price or cost, without discount
price = 100 * qty
This checks if the quantity is greater than 1000
if qty >1000:
If yes, this calculates the price or cost, after discount
price = (100 - 0.10 * 100) * qty
This prints the calculated cost
print("Cost: "+str(price))
Answer:
True: In binary search algorithm, we follow the below steps sequentially:
Input: A sorted array B[1,2,...n] of n items and one item x to be searched.
Output: The index of x in B if exists in B, 0 otherwise.
- low=1
- high=n
- while( low < high )
- { mid=low + (high-low)/2
- if( B[mid]==x)
- {
- return(mid) //returns mid as the index of x
- }
- else
- {
- if( B[mid] < x) //takes only right half of the array
- {
- low=mid+1
- }
- else // takes only the left half of the array
- {
- high=mid-1
- }
- }
- }
- return( 0 )
Explanation:
For each iteration the line number 11 or line number 15 will be executed.
Both lines, cut the array size to half of it and takes as the input for next iteration.
Answer:
//Here is the for loop in C.
for(n=10;n>0;n--)
{
printf("count =%d \n",n);
}
Explanation:
Since C is a procedural programming language.Here if a loop that starts with n=10; It will run till n becomes 0. When n reaches to 0 then loop terminates otherwise it print the count of n.
// here is code in C++.
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{ // variables
int n;
// for loop that runs 10 times
// when n==0 then loop terminates
for(n=10;n>0;n--)
{
cout<<"count ="<<n<<endl;
}
return 0;
}
Output:
count =10
count =9
count =8
count =7
count =6
count =5
count =4
count =3
count =2
count =1
Answer:
Command: Systemoutprintln (b)
Output: 7
Explanation:
To solve this problem, we must take into account the precedence of operation.
The division takes precedence before the addition, so we must divide before we add for b.
So
int b = 4 + 6/2 = 4 + 3 = 7.
So
Command: Systemoutprintln (b)
Output: 7
