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. Write an algorithm INSERT which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place in the list.
Ans:
/* structure containing the data part and link part */
struct node
{
int data ;
struct node *link ;
} ;
/* Following the inserts node to an ascending order linked list
*/
void INSERT ( struct node **q, int num )
struct node *r, *temp = *q ;
r = malloc ( sizeof ( struct node ) ) ;
r -> data = num ;
/* if list is empty or if new node is to be inserted before the first node */
if ( *q == NULL || ( *q ) -> data > num )
*q = r ;
( *q ) -> link = temp ;
}
else
/* traverse the entire linked list to search or found the position to insert the
new node */
while ( temp != NULL )
if ( temp -> data <= num && ( temp -> link -> data > num ||
temp -> link == NULL ))
r -> link = temp -> link ;
temp -> link = r ;
return ;
temp = temp -> link ; /* go to the next node */ }
Merging 4 sorted files having 50, 10, 25 and 15 records will take time
Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.
Q. Write an algorithm that counts number of nodes in a linked list. A n s . Algo rithm to Count No. of Nodes in Linked List C
what is boot algorithm and some example
What is binary search? Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)
A BST is traversed in the following order recursively: Right, root, left e output sequence will be in In Descending order
Explain the term- Dry running of flowcharts Dry running of flowcharts is essentially a technique to: Determine output for a known set of data to check it carries out th
We have discussed already about three tree traversal methods in the earlier section on general tree. The similar three different ways to do the traversal -inorder , preorder, and p
Question 1. Explain the different types of traversal on binary tree 2. Explain the Prim's minimum spanning tree algorithm 3. Differentiate fixed and variable storage allo
You need to write a function that performs multiplication of two numbers in your data structure. Again, remember how you multiply numbers in base 10 and you should be fine. Multipl
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