Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.
Ans.
function to Delete Terminal Nodes from Binary Tree
void deleteleaves(struct node* root,struct node* prev)
{
if(root)
if(root->left==NULL&&root->right==NULL)
if(prev->item>=root->item)
prev->left=NULL;
else
prev->right=NULL;
printf("\n\n %d Is Being Deleted ...",root->item);
free(root);
return;
}
deleteleaves(root->left,root);
deleteleaves(root->right,root);
the call to this function will deleteleaves (root, root).
The two famous methods for traversing are:- a) Depth first traversal b) Breadth first
give any example of page replacement using fifo and use your own reference string
explanation of doubly linklist
Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.
sir how can i explain deletion process in a data structure
WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO POSTFIX FORM ALSO TRACE ALG ON ((A+B)*C-(D-E)$F+G)
algorithms
24 56 47 35 10 90 82 31
Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru
Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd