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.
A big question or problem in the tech field that i would like to solve is Data security.
<h3>What is Data security ?</h3>
Data security can be regarded as process of protecting data from unauthorized user as well as protection from data corruption .
I will like to solve this problem because as advances in technology, the data of individual or organization is not been total secured and this is posing so much loss to individuals.
Data security are;
- data encryption
- hashing
- tokenization
Learn more about Data security at;
brainly.com/question/17493537
TTYT stands for "talk to you tomorrow".
Subdirectory
Have a great day! c:
In python 3.8:
print(len([x for x in input("Enter your text: ") if x not in "., "]))
I hope this helps!