Please enable JavaScript.
Coggle requires JavaScript to display documents.
LinkedList - Coggle Diagram
LinkedList
-
Pointers
x.next
pseuducode
if x.next = NIL element x has no succesor, x.next = tail
x.prev
pseuducode
if x.prev = NIL element x has no predecessor, x.prev = head
Overview
Linked lists are unlike arrays, non-linear ordered data structures. unlike arrays which are ordered via their indices LinkedList order is determined by pointers. they provide simple flexibility and representation of dynamic sets. LL are also made up of a head, tail, head pointer, tail pointer
Attributes
Linkedlist L
pseuducode
-
if L.head = NILL, List = empty
-
