Linked list algorithms in Pseudo code Class Linked List Data: head-Pointer to No

Question

Linked list algorithms in Pseudo code Class Linked List Data: head-Pointer to Node that will hold the head pointer of the list Len: number of Nodes in the linked list Default constructor Linked list- will be called when linked list is created (Usually done in automatic memory) head-NULL len = 0 Member function insert node (data) input: data to be inserted into linked list (stored in Node) output: None returns: Nothing ptr = allocate a new Node (Put data in node) prev= NULL curr- head while (curr != NULL and curr->data

Explanation / Answer

#include<iostream>
using namespace std;
struct Node
{
int data;
Node *link;

};
class LinkList
{
Node *head;
public:
LinkList()
{
head=NULL;

len=0;
ptr=allocate a new node;
prev=curr;
curr=currlink;

}

void insert_node(data)
{
Node *newNode;
newNode = new Node;
newNode ->link =NULL;
newNode ->data = val;
newNode ->link=headptr;
head = newNode;
}

void Display()
{
Node *disNode;
disNode = headptr;
while(curr !=NULL and cur->data < data)
{
prev=curr
curr = curr link
cout<<"Display Node Value is "<<disNode ->data<<endl<<endl;
  
}

if {
prev=NULL
put link=head;
head= ptr;
}
else
{
put link= prev link;
prev link =ptr;
len=len+1;
}

};
};
void main()
{
LinkList lobj;
lobj.InsertatFirst(45);
lobj.InsertatFirst(2);
lobj.InsertatFirst(1);
lobj.InsertatFirst(0);
lobj.InsertatFirst(-1);
lobj.Display();
}

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.