Add a proper function to the following linked list that will copy all elements with value above average into another list , then apply it to the list created in main function and print your resultant list. Example: l.copy(l2); will copy all elements with value greater than average into l2 #include using namespace std; struct node { int data; node *next,*prev; node(int d,node *p=0,node *n=0) { data=d; prev=p; next=n; } }; class list { node *head; public: list(); void print(); void add_end(int el); }; list::list() { head=0; } void list::add_end(int el) { if(head==0) head=new node(el); else { node *t=head; for(;t->next!=0;t=t->next); t->next=new node(el,t); } } void list::print() { for(node *t=head;t!=0;t=t->next) cout<data<<" "; cout<

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Add a proper function to the following linked list that will copy all elements with value above average into another list , then apply it to the list created in main function and print your resultant list.

Example:

l.copy(l2); will copy all elements with value greater than average into l2

#include <iostream>

using namespace std;

struct node

{

    int data;

    node *next,*prev;

    node(int d,node *p=0,node *n=0)

    {    data=d;    prev=p;    next=n;    }

};

class list

{

    node *head;

public:

    list();

    void print();

    void add_end(int el);

};

list::list()

{

    head=0;

}

void list::add_end(int el)

{

    if(head==0)

        head=new node(el);

    else

    {

        node *t=head;

        for(;t->next!=0;t=t->next);

        t->next=new node(el,t);

    }

}

void list::print()

{

    for(node *t=head;t!=0;t=t->next)

        cout<<t->data<<" ";

    cout<<endl;

}

void main()

{

    list l;

    l.add_end(7);

    l.add_end(3);

    l.add_end(9);

    l.add_end(2);

    l.add_end(3);

    l.add_end(8);

    l.add_end(6);

    l.print();

    system("pause");

 

Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Structure
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education