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

fixing line breaks

Browse Source
This commit is contained in:
Jidong Xiao
2023-10-05 19:08:39 -04:00
parent 28b66195e8
commit afe4ad6bef
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lectures/11_list_implementation/README.md
View File

@@ -40,7 +40,7 @@ Node<T>* prev_;
}; };
``` ```
- Note that we now assume that we have both a head pointer, as before and a tail pointer variable, which stores the address of the last node in the linked list. - Note that we now assume that we have both a head pointer as before, and a tail pointer variable, which stores the address of the last node in the linked list.
- The tail pointer is not strictly necessary, but it allows immediate access to the end of the list for efficient - The tail pointer is not strictly necessary, but it allows immediate access to the end of the list for efficient
push-back operations. push-back operations.
@@ -52,9 +52,9 @@ picture of the state of affairs:
![alt text](insert.png "insert") ![alt text](insert.png "insert")
- What must happen? Editing the diagram above... - What must happen? Editing the diagram above...
– The new node must be created, using another temporary pointer variable to hold its address. – The new node must be created, using another temporary pointer variable to hold its address.
– Its two pointers must be assigned. – Its two pointers must be assigned.
– Two pointers in the current linked list must be adjusted. Which ones? – Two pointers in the current linked list must be adjusted. Which ones?
- Assigning the pointers for the new node MUST occur before changing the pointers for the current linked list - Assigning the pointers for the new node MUST occur before changing the pointers for the current linked list
nodes! nodes!