course-work/week2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update 4-stack/README.md

Browse Source
This commit is contained in:
William Mantly 2024-02-01 15:47:49 +00:00
parent f4034546cc
commit e49b5fa8d1
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
4-stack/README.md
View File

@ -5,7 +5,7 @@ Wikipedia on [stacks](http://en.wikipedia.org/wiki/Stack_(abstract_data_type)).
Similarly, the Linked List, a stack is an abstract data type. It is LIFO, or Last In First Out. Each node holds data and a pointer to the next node. Similarly, the Linked List, a stack is an abstract data type. It is LIFO, or Last In First Out. Each node holds data and a pointer to the next node.
###Visualization ### Visualization
|42| |42|
| |
@ -21,7 +21,7 @@ The main operations available to the Stack are push and pop.
- Pop should remove the top node and return it. - Pop should remove the top node and return it.
- Push should add to the top of the stack. - Push should add to the top of the stack.
###Methods ### Methods
Create your datatypes and create the following methods: Create your datatypes and create the following methods:
@ -33,7 +33,7 @@ Create your datatypes and create the following methods:
- empty - Is the stack empty? - empty - Is the stack empty?
###Additional Methods ### Additional Methods
In the wikipedia article, read under the title "Hardware Stacks". Emulating a hardware stack, add the operations it lists to your class. This is open ended and implementation is up to you. In the wikipedia article, read under the title "Hardware Stacks". Emulating a hardware stack, add the operations it lists to your class. This is open ended and implementation is up to you.