Opinion is the answer, every thing else can be compared with the data
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.
B.) is what most employers are looking for
Answer:
#include <iostream>
using namespace std;
int main()
{
string str;
cout<<"Enter the string: ";
cin>>str;
for(int i=0;str[i]!='\0';i++){
if(str[i]=='e'){
str[i]='x';
}
}
cout<<"the string is: "<<str<<endl;
return 0;
}
Explanation:
First, include the library iostream for using the input/output instructions.
Create the main function and declare the variables.
Then, use the cout instruction and print the message on the screen.
cin store the string enter by the user into a variable.
After that, take a for loop and if-else statement for checking the condition if the string contains the 'e', then change that alphabet to 'x'.
This process continues until the string not empty.
Finally, print the updated string.
