• 0

C++ linked list and objects


Question

I have been given an assignment from my uni to create a bank where im to have customers with multiple accounts and different account types, also then add other things like loans etc.

Im having problems getting a linked list to work with the class objects. my aim is to store all the customers details, and account details in the class objects then list all the customers in the linked list instead of using something like an array as we get more marks for using linked lists.

so far i have managed to get it so the customer can be created and pointing to just one account. but i am stuggling with understanding how im to then create the linked list so it connects to the class object.

these are some bits of the code which i have so far:

AssignmentBank.cpp (main)

	Account tempAccount(001, 500, 600, "Current");
	Customer tempCustomer("Fred", 01, 0.5, 'M',"180690", &tempAccount);
	CustomerList CL;	
	CL.addCustomer(&tempCustomer);

with this im not sure if im doing it the correct way, but am i to create the objects then pass in the refference to it, which is then stored in the linked list?

CustomerList.cpp

#include "CustomerList.h"
#include <iostream>

using namespace std ;

CustomerList::CustomerList()
{
    front = back = 0;
}

bool CustomerList::isEmpty()
{
   return front == 0;
}


void CustomerList::addCustomer(Customer *tempCustomer)
{
	Node* insert  = new Node(tempCustomer); 
	if (front == 0)
   {
      back = front = insert;
   }
   else
   {
      back-> next = insert ;      
	   back = back -> next ;
   }
}

CustomerList::removeCustomer()
{
   Customer tempCustomer; Node* temp;

	if (front != 0)
   {
      tempCustomer = front -> customerRef;
      temp = front;
      front = front -> next ;
      delete temp ;
      if (front == 0) back = 0;
      return tempCustomer;
   }
   else return '\0';

}


CustomerList::~CustomerList()
{
   Node * temp;
	while(front != 0)
	{
		temp = front;
		front = front -> next;
		delete temp;  
	}
}


void CustomerList::print()
{
	Node * temp = front;
   if (temp != 0 ) 
   {
	   while (temp != 0)
	   {
		   cout << temp -> customerRef.getName() ;
		   temp = temp -> next;
      }
   }
   else cout << "empty";
   cout << endl;

}

CustomerList.h

#include "Customer.h"

class Node
{
public:
	Node* next;
	Customer customerRef;
	Node(tempCustomer)
	{
		Customer *tempCustomer;
		next = 0;
	}	
};


class CustomerList
{
	Node* front;
        Node* back;
public:
	CustomerList();
	~CustomerList();
	void addCustomer(Customer *tempCustomer);
   removeCustomer( );
	bool isEmpty();
   void print() ;

};

any help at all would be useful.

I have gone to extra classes at uni and asked lecturers over and over but they dont seem to be helping me much.

Link to comment
https://www.neowin.net/forum/topic/955220-c-linked-list-and-objects/
Share on other sites

7 answers to this question

Recommended Posts

  • 0

The problem is your Node class: you have to decide whether you want it to hold copies of Customers or references(pointers) to Customers. Both approaches are valid yet different. If you go with references, you have to ensure that the original Customers remain alive otherwise the references will soon point to nothing. If you go with values (copies), there's no dangling reference issue but of course you encur the performance cost of the copy.

This is basically how I would code it:

struct Node // if you only want public members, use a struct, it's the same thing as class except everything is public by default
{
        Node* m_next;
        Customer& m_customer;
        Node(Customer& customer) : m_next(0), m_customer(customer) {}   
};

And then the addCustomer method would look virtually identical to yours (except I like references better when I can use them):

void CustomerList::addCustomer(Customer& customer)
{
    Node* insert  = new Node(customer); 
    if (front == 0)
   {
      back = front = insert;
   }
   else
   {
      back->next = insert;   
      back = back ->next;
   }
}

  • 0

A struct is a class in C++. They are literally duplicate keywords. The only difference is that default visibility is private in a class, whereas it is public in a struct. So if all it takes to satisfy your teacher is to not use the keyword "struct", change "struct" by "class" and add "public:" before the member declarations. :laugh:

Seriously though, it's not clear to me what your teacher meant by that. The C++ way of doing a linked list is usually:

#include <list>

int main()
{
    // look ma no code
    std::list<int> linkedList;
    linkedList.push_back(1);
    // etc
}

  • 0

thank you, i got it working after playing around a little with what i already had. can now add customers and display them how i need to.

problem is now i want to be able to have multiple accounts for each customer.

at the moment i have:

customer.cpp

Customer::Customer(string tempName, string tempTelNo, double tempInterestRate, char tempSex, string tempDoB, Account *bankAccount)
{
	name=tempName;
	telNo=tempTelNo;
	interestRate=tempInterestRate;
	sex=tempSex;
	DoB=tempDoB;
	accountRef=bankAccount;
}

and an example of creating a customer is:

AssignmentBank.cpp

CL.addCustomer(new Customer("Fred", "01785211211", 0.5, 'M',"110284", new Account(002, 600, 700, "Current")));

thing is i want to be able to make lots of accounts without a limit really.

and if i go to the array option then i cant change the size of the array can i?

can someone point me in the right direction of how i can do this?

  • 0

You need a linked list structure for everything you need a list of - customers, accounts, etc. Rather than duplicating the linked list code for each type of list, look into templating!

When creating your new example customer, you'd do it something like:

Customer* custTmp = new Customer("Fred", "01785211211", 0.5, 'M', "110284");
CustTmp->addAccount(new Account(002, 600, 700, "Current"));
CustTmp->addAccount(new Account(003, 601, 701, "Current"));
//etc
CL.addCustomer(custTmp);
custTmp = 0; //no need to keep a copy of the pointer here in main(), the linked list has it and can handle freeing up memory when necessary, safer to disarm this!

  • 0
  On 23/11/2010 at 00:18, theblazingangel said:

You need a linked list structure for everything you need a list of - customers, accounts, etc. Rather than duplicating the linked list code for each type of list, look into templating!

When creating your new example customer, you'd do it something like:

Customer* custTmp = new Customer("Fred", "01785211211", 0.5, 'M', "110284");
CustTmp->addAccount(new Account(002, 600, 700, "Current"));
CustTmp->addAccount(new Account(003, 601, 701, "Current"));
//etc
CL.addCustomer(custTmp);
custTmp = 0; //no need to keep a copy of the pointer here in main(), the linked list has it and can handle freeing up memory when necessary, safer to disarm this!

I understand how to create them as you have mentioned, just not to sure how to add the references of the accounts to the customer.

  • 0

I haven't used C++ in quite some time, but when I did, I made an arraylist class. Just a doubly linked list... I found it pretty fun to make, and I put it on Google Code.

You can check out the adding method here, among many others: http://code.google.com/p/arraylist/source/browse/trunk/arraylist.cpp#119

This topic is now closed to further replies.
  • Recently Browsing   0 members

    • No registered users viewing this page.
  • Posts

    • Google Chrome 137.0.7151.120 (offline installer) by Razvan Serea The web browser is arguably the most important piece of software on your computer. You spend much of your time online inside a browser: when you search, chat, email, shop, bank, read the news, and watch videos online, you often do all this using a browser. Google Chrome is a browser that combines a minimal design with sophisticated technology to make the web faster, safer, and easier. Use one box for everything--type in the address bar and get suggestions for both search and Web pages. Thumbnails of your top sites let you access your favorite pages instantly with lightning speed from any new tab. Desktop shortcuts allow you to launch your favorite Web apps straight from your desktop. Chrome has many useful features built in, including automatic full-page translation and access to thousands of apps, extensions, and themes from the Chrome Web Store. Google Chrome is one of the best solutions for Internet browsing giving you high level of security, speed and great features. Important to know! The offline installer links do not include the automatic update feature. Google Chrome 137.0.7151.120 changelog: [$7000][420697404] High CVE-2025-6191: Integer overflow in V8. Reported by Shaheen Fazim on 2025-05-27 [$4000][421471016] High CVE-2025-6192: Use after free in Profiler. Reported by Chaoyuan Peng (@ret2happy) on 2025-05-31 [425443272] Various fixes from internal audits, fuzzing and other initiatives Download web installer: Google Chrome Web 32-bit | Google Chrome 64-bit | Freeware Download: Google Chrome Offline Installer 64-bit | 128.0 MB Download: Google Chrome Offline Installer 32-bit | 115.0 MB Download page: Google Chrome Portable Download: Google Chrome MSI Installers for Windows (automatic update) View: Chrome Website | Release Notes Get alerted to all of our Software updates on Twitter at @NeowinSoftware
    • -Drop the art style, it's cool but doesn't fit the franchise at all. -Make it a gritty single player game, like Halo -Include deathmatch and all that stuff, extraction can be a separate mode If they don't do that, it's dead on arrival IMO.
    • It's a shame because it's one of the best immersive sims ever made, even though it could have used a bit more monster variety IMO.
    • He said "for some projects". There's no way that 30% of Windows' code is written by AI.
  • Recent Achievements

    • One Month Later
      Custom Greek Shirts earned a badge
      One Month Later
    • Week One Done
      Custom Greek Shirts earned a badge
      Week One Done
    • One Year In
      Custom Greek Shirts earned a badge
      One Year In
    • Week One Done
      topantidetectbrowser earned a badge
      Week One Done
    • Explorer
      Jdoe25 went up a rank
      Explorer
  • Popular Contributors

    1. 1
      +primortal
      672
    2. 2
      ATLien_0
      281
    3. 3
      Michael Scrip
      223
    4. 4
      +FloatingFatMan
      190
    5. 5
      Steven P.
      146
  • Tell a friend

    Love Neowin? Tell a friend!