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:
try typing that into gooy gle im sorry if i didnt help
if tickets >400 What is the missing term in the code that handles that error??wat over400error
Explanation:
Answer:
Joe should read the explanatory text and complete the learning activities.
Explanation:
Given
See attachment for options
Required
Best strategy to get through the module
First off, rushing through the activities and taking guess for each question (as suggested by (a)) will not help him;
He may complete the activities but sure, he won't learn from the module.
Also, reading through the units without completing the activities is not an appropriate method because Joe will not be able to test his knowledge at the end of the module.
The best strategy to employ is to read through the units and complete the activities, afterwards (option (b)).
Answer:
Auto-negotiation protocol is the modern technology in the networking. This protocol allow the ethernet equipment for automate different instillation steps. This type of protocol use by interconnecting various electronic devices for negotiating the speed of the link.
Advantages:
- The auto negotiation protocol features used to maximize the throughput of data link layer.
- This protocol are basically useful in the local area network (LAN), with multiple capability of connections.
- The auto negotiation protocol extremely useful in twisted pair which are based on ethernet.
Disadvantages:
- This type of protocol are not fixed data links and not used as backbone of the networks.
- Duplex mismatch occur then, it cause significant loss in the packets.