To compare data makes the most sense
Answer:
There is nothing to answer from this statement.
Explanation:
Can you rephrase the statement into question?
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.
D) a type of training that allows...
user_str1 = str ( input ("Please enter a phrase: "))
user_str2 = str ( input("Please enter a second phrase: "))
def strcmp (word):
user_in1 = int (len(user_str1))
user_in2 = int (len(user_str2))
if user_in1 > user_in2:
return "Your first phrase is longer"
elif user_in1 < user_in2:
return "Your second phrase is longer"
else:
return "Your phrases are of equal length"
