LINKED LIST Insertion at the beginning $1.2.$ Insertion at the end $1.2.$ Searching is done by checking the value with the target value, if it obtained, address of the node returned else pointer points to next node Deletion Searching is performed to start the deletion of a spec fic node with a value. Deleting the first node Delete$(10)$ Deleting the node in the middle Delete$(20)$ Deleting the last node Head Insert $10$ at beginning Insert $20$ at end Insert $30$ at beginning Insert $40$ at end Delete $20$ Delete $10$ Insert $50$ at beginning Insert $60$ at end Insert $70$ at beginning Insert $80$ at end Delete $30$ Delete $40$ Delete $50$ Insert $90$ at beginni