single linked list

Verfasst von

in

ll
- head
- last
- curr

ausgangslage:
head -> l1
curr -> l1
last -> l4
l1  
nx -> l2
      nx -> l3
            nx -> l4
                  nx -> null

remove l1:
head -> l2 <<
curr -> l2 <<
l2        
nx -> l3
      nx > l4
           nx -> null

remove l2:
l1
nx -> l3
      nx -> l4
            nx -> null

remove l4:
last-> l3
l1 
nx -> l2
      nx -> l3
            nx -> null