CS 300 – Analysis & Design | Module Three Assignment 3-2 – Linked List Implementation |SNHU| Pseudocode| Reflection| Complete C++ Code| Grade A

CS 300 Module Three Assignment

1. Pseudocode

Start Program

Define Struct Bid

bidId: string

title: string

fund: string

amount: double



Define Class LinkedList

Node:

bid: Bid

next: Node pointer

head: Node pointer

tail: Node pointer

size: integer



Constructor:

head = nullptr

tail = nullptr

size = 0



Destructor:

While head is not nullptr:

temp = head

, head = head.next

delete temp



Append(bid):

Create newNode with bid

If head is nullptr:

head = tail = newNode

Else:

tail.next = newNode

tail = newNode

size++



Prepend(bid):

Create newNode with bid

If head is nullptr:

head = tail = newNode

Else:

newNode.next = head

head = newNode

size++



PrintList():

current = head

While current is not nullptr:

Print current.bid