JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding list implementation

Browse Source
This commit is contained in:
Jidong Xiao
2024-02-13 13:18:21 -05:00
parent 62f30d5f3e
commit ae6e937a3d
3 changed files with 9 additions and 59 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
lectures/11_list_implementation/README.md
View File

@@ -73,13 +73,18 @@ variable p.
- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/doubly_lists/remove/index.html) to see how the remove works.
## 11.7 Special Cases of Remove
## 11.6 Special Cases of Remove
- If p==head and p==tail, the single node in the list must be removed and both the head and tail pointer
variables must be assigned the value NULL.
- If p==head or p==tail, then the pointer adjustment code we just wrote needs to be specialized to removing
the first or last node.
## 11.7 List Implementation
- We have a list implementation [here](list.h).
- And we can test our list with this [program](list_main.cpp).
## 11.8 Leetcode Exercises
- [Leetcode problem 141: Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/). Solution: [p141_linkedlistcycle.cpp](../../leetcode/p141_linkedlistcycle.cpp)