Homework Answers
struct Node * find_ll(struct Node* anchor, char *word) // Checks whether the word is present in linked list.
{
Node* search = head; // Initialize search
while (search != NULL)
{
if (search->key == x)
return search;
search = search->next;
}
return NULL;
}
Explanation:
1) we will first initialize a node pointer search=head .
2) while search is not equal to null
a) if search ->key is equal to key word searched ,then return the pointer.
b) search= search ->next
3) return false.
Add Answer to:
struct Node * new_11( void ) { // return a new node to be the list...
Modify the below code to fit the above requirements: struct node { char data; struct node...
Modify the below code to fit the above requirements:
struct node
{
char data;
struct node *next;
struct node *previous;
} *front, *MyNode, *rear, *MyPointer, *anchor *Valuenode ;
typedef struct node node;
int Push(char input)
{
if(IsFull()==1)
{
printf("The queue is full. Enter the ‘^’ character to
stop.\n");
return -1;
}
else if (IsFull()==-1)
{
node *MyNode=(node*)malloc(sizeof(node));
MyNode->data=input;
rear->next=MyNode;
MyNode->previous=rear;
MyPointer=rear=MyNode;
return 1;
}
else
{
node *MyNode=(node*)malloc(sizeof(node));
node *anchor=(node*)malloc(sizeof(node));
MyNode->data=input;
MyPointer=rear=front=MyNode;
MyNode->previous=NULL;
MyNode->next=NULL;
anchor->next=MyNode;
return 0;
}
}
char...
In c++, what alternative to malloc line? Such as struct Node* newNode(int data) { struct Node*...
In c++, what alternative to malloc line? Such as struct Node* newNode(int data) { struct Node* node = (struct Node*) malloc(sizeof(struct Node)); node->data = data; node->left = NULL; node->right = NULL; return node; }
() Given the following structure definition and typedef for a linked list of strings: typedef struct...
() Given the following structure definition and typedef for a linked list of strings: typedef struct node st node; struct node st { char *word; /* a valid string pointer or NULL */ node *next; /* next node in the list or NULL */ }; Write a C function, free list(), that takes as an argument one of these lists, possibly NULL, and frees all the strings as well as the list itself. Write robust code. void free list(node *list){
in the c programming language. List *init() { head = ( List * ) malloc( sizeof(...
in the c programming language. List *init() { head = ( List * ) malloc( sizeof( List ) ); if ( head == NULL ) { prtError( "Insufficient memory!" ); return( NULL ); } head->data = -1; head->next = NULL; tail = head; return ( head ); } /* Insert a new data element d into the list. */ /* Insert at the front of the list, right behind the dummy node. */ /* Return NULL if a new node...
Programming in C: I am trying to modify this linked list to be doubly linked list....
Programming in C: I am trying to modify this linked list to be doubly linked list. I’m also trying to add a print in reverse function. I’m really struggling with how to change the insert function to doubly link the nodes without effecting the alphabetical sorting mechanism. Example of desired output: Enter your choice: 1 to insert an element into the list. 2 to delete an element from the list. 3 to end. ? 1 Enter a character: a The...
Implement a program that: reads a number of personal records (for example, using PERSON struct from...
Implement a program that: reads a number of personal records (for example, using PERSON struct from the earlier lab) from the standard input, creates a database of personal records, allows for adding new entries to the database, allows for deleting entries from the database, includes functions to acquire a record of personal data, and includes functions to display (print) a single selected record from the database, and also allows for printing all records in the database. NOTES: if name is...
****find_last_node.c #include <stdio.h> #include "linked_list.h" int main(){ ...
****find_last_node.c
#include <stdio.h>
#include "linked_list.h"
int main(){
struct node *linked_list = NULL;
linked_list = add_to_list(linked_list, 5,
'a');
linked_list = add_to_list(linked_list, 10, 'b');
linked_list = add_to_list(linked_list, 4, 'c');
linked_list = add_to_list(linked_list, 10, 'd');
linked_list = add_to_list(linked_list, 5, 'e');
linked_list = add_to_list(linked_list, 7, 'f');
linked_list = add_to_list(linked_list, 5, 'g');
linked_list = add_to_list(linked_list, 3, 'h');
int search_number;
printf("Enter number you want to search for:");
scanf("%d", &search_number);
struct node *last_node = find_last(linked_list,
search_number);
if (last_node != NULL)
{
printf("Node found: value = %d and...
Given the following linked list structure called node: struct node { int val; struct node *...
Given the following linked list structure called node: struct node { int val; struct node * ptrNext; }; Assume we have a single list created from this structure with a head pointer called ptrFirst which is declared in the global scope. a. Write a complete C function called CountEven to count all the even values in this singly linked list of arbitrary number of nodes using an iterative (non-recursive) approach. The function takes as parameter the pointer to the starting...
Write a function with the following prototype struct node* copyList(struct node* 1ist) The struct node is...
Write a function with the following prototype struct node* copyList(struct node* 1ist) The struct node is the same used in question 18. The function should create a new, separate copy of the linked list pointed to by the list parameter and return a pointer to the head of the newly created linked list copy.
Please rewrite this function using recursive function #include using namespace std; struct Node { char ch;...
Please rewrite this function using recursive function #include using namespace std; struct Node { char ch; Node* next; }; class LinkedList { Node* head; public: LinkedList(); ~LinkedList(); void add(char ch); bool find(char ch); bool del(char ch); friend std::ostream& operator<<(std::ostream& out, LinkedList& list); }; LinkedList::LinkedList() { head = NULL; } LinkedList::~LinkedList() { Node* cur = head, * tmp; while (cur != NULL) { tmp = cur->next; delete cur; cur = tmp; } } void LinkedList::add(char ch) { Node* cur = head,...
Modify the below code to fit the above requirements:
struct node
{
char data;
struct node *next;
struct node *previous;
} *front, *MyNode, *rear, *MyPointer, *anchor *Valuenode ;
typedef struct node node;
int Push(char input)
{
if(IsFull()==1)
{
printf("The queue is full. Enter the ‘^’ character to
stop.\n");
return -1;
}
else if (IsFull()==-1)
{
node *MyNode=(node*)malloc(sizeof(node));
MyNode->data=input;
rear->next=MyNode;
MyNode->previous=rear;
MyPointer=rear=MyNode;
return 1;
}
else
{
node *MyNode=(node*)malloc(sizeof(node));
node *anchor=(node*)malloc(sizeof(node));
MyNode->data=input;
MyPointer=rear=front=MyNode;
MyNode->previous=NULL;
MyNode->next=NULL;
anchor->next=MyNode;
return 0;
}
}
char...
****find_last_node.c
#include <stdio.h>
#include "linked_list.h"
int main(){
struct node *linked_list = NULL;
linked_list = add_to_list(linked_list, 5,
'a');
linked_list = add_to_list(linked_list, 10, 'b');
linked_list = add_to_list(linked_list, 4, 'c');
linked_list = add_to_list(linked_list, 10, 'd');
linked_list = add_to_list(linked_list, 5, 'e');
linked_list = add_to_list(linked_list, 7, 'f');
linked_list = add_to_list(linked_list, 5, 'g');
linked_list = add_to_list(linked_list, 3, 'h');
int search_number;
printf("Enter number you want to search for:");
scanf("%d", &search_number);
struct node *last_node = find_last(linked_list,
search_number);
if (last_node != NULL)
{
printf("Node found: value = %d and...
Write a function with the following prototype struct node* copyList(struct node* 1ist) The struct node is the same used in question 18. The function should create a new, separate copy of the linked list pointed to by the list parameter and return a pointer to the head of the newly created linked list copy.
Most questions answered within 3 hours.
-
(CO 2) A field can be added to a report to
values for two or more...
asked 1 hour ago -
Identify 3 research scenarios that might provide a low,
medium, and high degree of variability in...
asked 1 hour ago -
how
does gravity affect the trajectory of projectile? what would be the
shape of the trajactory...
asked 2 hours ago -
Two small plastic spheres are given positive electrical charges.
When they are a distance of 15.4...
asked 2 hours ago -
An acidic solution containing gold ions is
electrolyzed, producing gaseous oxygen (from water) at the anode...
asked 2 hours ago -
Assume that the population of Mexico is 128
million and that the population increases 1.01
percentannually....
asked 3 hours ago -
Can someone please help me add appropriate descriptive
comments to each line of code in the...
asked 3 hours ago -
Romeo wishes to throw a bouquet of flowers to Juliet, who is on
a second-story balcony,...
asked 4 hours ago -
Why is QE a controversial monetary policy tool.
A. It may lead to excessive inflation.B. By...
asked 5 hours ago -
Principles of Programming midterm study guide help!
1.)
______ Which of the following would reference the...
asked 4 hours ago -
A finite potential well has depth U0 = 2.78 eV . What is the
penetration distance...
asked 5 hours ago -
1. The bus bars of a power station are in two sections A and B
separated...
asked 5 hours ago