연결 리스트 (Linked List)

#pragma once

#include <iostream>
using namespace std;

struct Node
{
	int data;
	Node* next;
};


class LinkedList
{
private:
	int m_count;
	Node* m_head;

public:
	LinkedList();
	~LinkedList();

	void Insert(int _position, int _item);
	void Delete(int _position);
	int Retrieve(int _position);

	bool IsEmpty();
	int GetLength();

};

LinkedList.h

 

 

 

 

 

#include "LinkedList.h"

LinkedList::LinkedList() : m_count(0), m_head(nullptr)
{

}

LinkedList::~LinkedList()
{

}

void LinkedList::Insert(int _position, int _item)
{
	Node* currentNode = m_head;
	Node* insertNode;

	insertNode = new Node;
	insertNode->data = _item;

	if (_position == 0 || m_head == nullptr)
	{
		insertNode->next = m_head;
		m_head = insertNode;
		m_count++;

		return;
	}

	for (int i = 0; i < _position - 1; i++)
		currentNode = currentNode->next;

	insertNode->next = currentNode->next;
	currentNode->next = insertNode;
	m_count++;

}

void LinkedList::Delete(int _position)
{
	Node* currentNode = m_head;
	Node* deleteNode;

	if (_position == 0)
	{
		deleteNode = m_head;
		m_head = m_head->next;
		delete deleteNode;
		m_count--;

		return;
	}

	for (int i = 0; i < _position - 1; i++)
		currentNode = currentNode->next;

	deleteNode = currentNode->next;
	currentNode->next = deleteNode->next;
	delete deleteNode;
	m_count--;

}

int LinkedList::Retrieve(int _position)
{
	Node* temp = m_head;

	for (int i = 0; i < _position; i++)
		temp = temp->next;

	return temp->data;

}

bool LinkedList::IsEmpty()
{

	return m_count == 0;

}

int LinkedList::GetLength()
{

	return m_count;

}

LinkedList.cpp