# data[].attributes.body
dflckdmflksmdflmd;glndfgsfldf

# data[].attributes.body
-Have cll implemented

-Assign p to nn prev
-then assign q to nn next
-p next = nn
-q prev = nn

# data[].attributes.body
-Have cll implemented

-assign header node to the (node being deleted)->next

-assign (node being deleted)->next = header

-delete node

# data[].attributes.body
- accessibility is easier
- can easily move forward
-SLL only moves forward/linear and can't backtrack
-DLL can back Track but can be trickier to implement a DLL

# data[].attributes.body
- Must have a linked list implemented already, concept is deleting a node of a list and to redirect that connection elsewhere.

- must have certain safety procedures in deleting a node such as making sure there is even a node at all or if there is only one node

# data[].attributes.body
- Whether it's already an implemented linked list or you're inserting a node into an already linked list the concept remains the same when updating new connections and updating important nodes (frontNode when inserting at front or backNode when inserting at back) the idea remains the same.

# data[].attributes.body
- The concept is super similar to deletion in SLL yet much more complex and confusing if you don't understand the procedures.
- each time you point to a next you have to set a prev