0
What else can I help you with?
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 } } }
The point on a stem to which a leaf or bud is attached is termed the?
the node, leaves are attached to the node by the petiole
What are the name of the stalk of a leaf?
PetioleThe stalk by which a leaf is attached to a stem. Also called Leafstalk.
What is the function of the petiole?
holds the leaf in connects to the plantpetiole is the thin green sructure that connects the main stem to a leaf.its also called MESOPODIUM.its main function is to direct the leaf from the branch so that it could get sufficient sunlight to perform photosynthesis
What is the leaf cell working parts?
this is for plants and leaf things There are different parts to a leaf or plant are.... The Stem, Axillary Bud, Internode, Axil, Node, Petiole, Stipule And the Leaf Lamina
In binary tree what is the name given to node that share the same parent node?
Sibling.
A what or scar appears at the base of the petiole where the petiole attaches to the stem?
Leaf scar
What is the counterpart of the petiole of dicot in monocot?
In monocot leaves petiole is represented by leaf- sheath..
What do you call the leaf without a petiole?
A leaf without a petiole is called a sessile leaf.
What is the relationship between the veins and the petiole?
The petiole is the delivery pipeline between plant stem and leaf vein.
What do you call the leaf without the petiole?
sessile
Do all leaves have pitioles?
no, because there are only petiole in petiolate leaves while the sessile leaves do not have a petiole:)
What part of the wave stays at the same place?
The node.
