Linked Lists (GSLC Data Struct 25 February 2020)
Hello, my name is Syafiq Maharaja. I am a student of binus university majoring computer Science. In this blog, I'm going to write a summary about Linked List II. 1. Circular Singly Linked List In Single Linked List, we start with the first node and if we are somehow at any node in the middle of the list, we can't access the previous node. But we can solve this problem by changing the structure of a Single Linked List itself. In Single Linked List, the next node is NULL, if we use this link to the point of the first node, then we can reach the nodes that come before the "middle node". The structure of Single Linked List looks like this : 2. Doubly Linked List Doubly Linked List is one of Linked List Variations. Double Linked List has a two ways direction and can move back and forth between nodes, which every node has 3 spaces. For the first node, the first space is a NULL and the third space is to point to the next nodes. For the middle node, the first spa...