Singly linked lists, doubly linked lists, and circular linked lists are types of linked data structures. Singly linked lists contain nodes with a data field and a next pointer. Doubly linked lists contain additional previous pointers. Circular linked lists connect the last node to the first node, making the list cyclic. Pseudocode is provided for common linked list operations like insertion, deletion, searching, on different positions in the lists.