a 1. 7. Following program is for the doubly linked list class. A node includes a

Question

a 1. 7. Following program is for the doubly linked list class. A node includes a data (in), two node pointers for pointing to the previous node and the next node. Please read problem carefully and answer the questions. #include kiostream> #include using namespace std; class doublyList private: struct Node int data; //data Node next; point to next node Node before; point to previous node Node head; //head of the list public: default constructor doubly List head NULL Append a node SKIPPED. i-------- insert Node (int a) Problem 4 Node newNode new Node Node traverse new Node new Node data a; new Node next. NULL; newNode before NULL if (head NULL) head new Node else

Explanation / Answer

1.

i.In linked list size is dynamic.

ii.In linked list easy to insert and delete the elements.

2.Basic linked lisk operations

1.concatenation

2.Traversing

3.Display

3. the end of the list signifies that linked list is going to be terminated.

4.list head dos not contain actual data.

it just contains reference or pointer.

5. Insertion node returns the data valuestored at the index position.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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