0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Write an iterative function to search an element in a binary search tree?
_node* search (_node* head, _key key) { _node* node; for (node=head; node != NULL;;) { if (key == node->key) return node; else if (key < node.>key) node = node->left; else node = node->right; } return node; }
Algoritm for deleting the last element from a list?
Given a list and a node to delete, use the following algorithm: // Are we deleting the head node? if (node == list.head) { // Yes -- assign its next node as the new head list.head = node.next } else // The node is not the head node { // Point to the head node prev = list.head // Traverse the list to locate the node that comes immediately before the one we want to delete while (prev.next != node) { prev = prev.next; } end while // Assign the node's next node to the previous node's next node prev.next = node.next; } end if // Before deleting the node, reset its next node node.next = null; // Now delete the node. delete node;
Is null node equal to leaf node?
No. A leaf node is a node that has no child nodes. A null node is a node pointer that points to the null address (address zero). Since a leaf node has no children, its child nodes are null nodes.
How many pointers will have to be changed if a node is deleted from a linear linked list?
For a singly-linked list, only one pointer must be changed. If the node about to be deleted (let's call it node for the sake of argument) is the head of the list, then the head node pointer must be changed to node->next. Otherwise, the node that comes before the deleted node must change its next pointer to node->next. Note that given a singly-linked node has no knowledge of its previous node, we must traverse the list from the head in order to locate that particular node, unless the node is the head of the list: void remove (List* list, Node* node) { if (!list !node) return; // sanity check!if (list->head == node) {list->head = node->next;} else {Node* prev = list->head;while (prev->next != node) prev = prev->next; // locate the node's previous nodeprev->next = node->next;}} Note that the remove function only removes the node from the list, it does not delete it. This allows us to restore the node to its original position, because the node itself was never modified (and thus still refers to its next node in the list). So long as we restore all removed nodes in the reverse order they were removed, we can easily restore the list. In order to delete a node completely, we simply remove it and then free it:void delete (List* list, Node* node) {if (!list !node) return; // sanity check!remove (list, node);free (node);} For a doubly-linked list, either two or four pointers must be changed. If the node about to be deleted is the head node, then the head node pointer must be changed to n->next and n->next->prev must be changed to NULL, otherwise, n->prev->next becomes n->next. In addition, if the node about to be deleted is the tail node, then the tail node pointer must be changed to n->prev and n->prev->next must be changed to NULL, otherwise, n->next->prev becomes n->prev. Deletion from a doubly-linked list is generally quicker than deletion from a singly linked list because a node in a doubly-linked list knows both its previous node and its next node, so there's no need to traverse the list to locate the previous node to the one being deleted. void remove (List* list, Node* node) {if (!list !node) return; // sanity check!if (list->head == node) {list->head = node->next;node->next->prev = NULL;} else {node->prev->next = node->next; }if (list->tail == node) {list->tail = node->prev;node->prev->next = NULL;} else {node->next->prev = node->prev; }} Again, to physically delete the node we simply remove and then free the node:void delete (List* list, Node* node) {if (!list !node) return; // sanity check!remove (list, node); free (node); }
How do you recursively reverse a singly linked list using c plus plus?
In this case recursion is not necessary, an iterative process is more efficient. Start by pointing at the head node. While this node has a next node, detach its next node and insert that node at the head. Repeat until the original head node has no next node. At that point the head has become the tail and all the nodes are completely reversed. The following example shows how this can be implemented, where the list object contains a head node (which may be NULL), and each node has a next node. The tail node's next node is always NULL. void reverse(list& lst) { if( node* p=lst.head ) { while(p->next) { node* n=p.next; // point to the next node p.next=n.next; // detach the next node n.next=lst.head; // insert the detached node at the head lst.head=n; // set the new head node } } }
Lump on your neck what can it be?
possibly an swollen lymph node possibly an swollen lymph node
What is the small lump under your armpi?
lymph node
Should you be worried if you've always had a very small non-painful lump on the back of your head and now that you are pregnant the lump has grown big and now it hurts and what could it be?
It's possible that it could be a lymph node in an odd location. My little sister had a lump on her head when she was born and it turned out to be a lymph node. We were told it may become swollen when she's sick, just like any other lymph node. Lymph nodes can become infected and pregnancy appears to increase the possibility. You should see a doctor.
What could cause an itchy lump on back of neck?
It may be that you have an infected hair follicle, oe a swollen lymph node. Other possibilities exist, as well. The best course of action would be to have it checked out by a doctor.
Lump on the back of your neck it come and goes?
A lump on the back of the neck that comes and goes could be caused by a variety of factors such as swollen lymph nodes, cysts, or muscle knots. It's important to monitor the size, shape, and any associated symptoms of the lump. If it persists or causes concern, it's best to consult a healthcare professional for proper evaluation and diagnosis.
Movable lump behind ear?
A lump behind the ear may possibly be a swollen lymph node. It can also be a benign tumor, a cyst, or acne.
Small lump behind ears not painful is it swollen lymph node?
could be a parotid tumour
Is a lump on your armpit bad?
it depends. It can either be a harmless lymph node, or a sign of breast cancer.
What could a small movable lump be inside the cheek just above the jaw?
A lump that is located by the jaw line in the neck can be indicative of many conditions, such a swollen lymph node or infected tooth. When there is swelling in this area, a follow up with a physician is recommended.
What foods should you avoid with infected lymph nodes?
As with any other infection, I believe glucose should be avoided if you have an infected lymph node. Glucose feeds the infection, and with the absence of glucose, the lymph node can recovery quicker.
I have had a Small lump right behind my left ear it does not hurt.?
It could just be a swollen lymph-node.
Soft lump under your armpit Ive had it since you can remember but its growing with time and it hurts every on an then?
This could be a serious condition, ranging from a tumor to an absess to an infected lymph node. You should please have it checked immediately -- swollen lymph nodes is a serious red flag.
