![\"\"](\"https:\/\/www.baizhao666.com\/wp-content\/uploads\/2023\/12\/LLdrawio.png\")
<\/figure>\n\n\n\n2. Doubly linked list:<\/p>\n\n\n\n
In a doubly linked list, each node contains references to both the next and previous nodes. Because of the next and previous references, we can traverse the doubly linked list in both directions. On the other hand, these references require more memory space comparing with singly linked list.<\/p>\n\n\n\n 3. Circular linked list:<\/p>\n\n\n\n In a circular linked list, the last node points back to the head node, creating a circular structure. It can be either singly or doubly linked.<\/p>\n\n\n\n Here we will implement the simplifying singly linked list, more details will be shown in data structure.<\/p>\n\n\n\n Output:<\/p>\n\n\n\n Stack and queue are important data structures in computer science, which can be used in many situations for efficiency. Stacks are a Last In First Out (LIFO) data structure. Queues are a First In First Out (FIFO) data structure.<\/p>\n\n\n\n Stacks and queues are used directly or indirectly in various different programming situations. For instance, Python codes are normally executed in the order they appear, in queue ordering in other words. Meanwhile, recursive function calls (and function calls in general) are handle through the call stack, meaning the first recursive function call is the last to be resolved.<\/p>\n\n\n\n Stacks and queue can be implemented using linked list. But in these case, we no long have access to the node in the middle of the list. Instead, we can only add or delete from the front or the end. More details will be shown in the data structures.<\/p>\n\n\n\n Reference:<\/p>\n\n\n\n GreeksforGreeks – Python Linked List: https:\/\/www.geeksforgeeks.org\/python-linked-list\/<\/p>\n","protected":false},"excerpt":{"rendered":" A linked list is an important programming concept that underlies a lot of modern data structures. Linked List is a linear data structure, in which elements are not stored at a contiguous location, rather they are linked using pointers. Linked List forms a series of connected nodes, where each node stores the data and the … <\/p>\n![\"\"](\"https:\/\/www.baizhao666.com\/wp-content\/uploads\/2023\/12\/Doublylinkedlist-1024x171.png\")
<\/figure>\n\n\n\n![\"\"](\"https:\/\/www.baizhao666.com\/wp-content\/uploads\/2023\/12\/CircularLinkeList.png\")
<\/figure>\n\n\n\nAdvantage of linked list:<\/h3>\n\n\n\n
\n
Disadvantage of linked list:<\/h3>\n\n\n\n
\n
# a class for a single node\nclass Node:\n def __init__(self, data):\n self.data = data\n self.next = None\n\n\n# a class for a linked list\nclass LinkedList:\n def __init__(self):\n self.head = None\n\n # insert a node to the end\n def insert(self, data):\n new_node = Node(data)\n # if there is no node in the list\n if self.head is None:\n # the new node is the head of the list\n self.head = new_node\n # if there is some nodes in the list\n else:\n # find the last node\n cur = self.head\n while cur.next is not None:\n cur = cur.next\n # add the new node to the end\n cur.next = new_node\n\n # delete a node from the end\n def delete(self):\n # if there is no node in the list, do nothing\n if self.head is None:\n return\n elif self.head.next is None:\n self.head = None\n else:\n # find the node before the last node\n cur = self.head\n while cur.next.next is not None:\n cur = cur.next\n cur.next = None\n\n # print out the list\n def display(self):\n cur = self.head\n while cur is not None:\n print(cur.data, end="->")\n cur = cur.next\n print()\n\n\n# create a linked list\nmy_list = LinkedList.LinkedList()\n# insert some node\nmy_list.insert(5)\nmy_list.insert(1)\nmy_list.insert(8)\nmy_list.insert(3)\nmy_list.insert(7)\n# print all the nodes in the list\nmy_list.display()\n# delete a node\nmy_list.delete()\nmy_list.display()\n# delete a node\nmy_list.delete()\nmy_list.display()\n# insert a node\nmy_list.insert(6)\nmy_list.display()<\/code><\/pre><\/div>\n\n\n\n5->1->8->3->7->\n5->1->8->3->\n5->1->8->\n5->1->8->6-><\/code><\/pre><\/div>\n\n\n\nStack and queue<\/h3>\n\n\n\n