Linked Lists

Linked lists are a fundamental data structure with various applications in robotics and computer vision. They provide a flexible way to store and manipulate data dynamically.

A linked list is composed of nodes, where each node contains a value and a reference to the next node in the sequence. The first node is called the head, and the last node is called the tail.

Unlike arrays, linked lists do not require contiguous memory allocation. Instead, each node can be located anywhere in memory, and its next pointer is used to connect it to the next node. This makes linked lists well-suited for situations where data needs to be dynamically inserted or removed.

Here is an example of a basic implementation of a linked list in Python:

1# Node class to represent individual nodes
2
3class Node:
4    def __init__(self, value):
5        self.value = value
6        self.next = None
7
8# Linked List class
9
10class LinkedList:
11    def __init__(self):
12        self.head = None
13
14    def append(self, value):
15        new_node = Node(value)
16
17        if self.head is None:
18            self.head = new_node
19        else:
20            current_node = self.head
21            while current_node.next:
22                current_node = current_node.next
23            current_node.next = new_node
24
25# Create a linked list
26
27linked_list = LinkedList()
28linked_list.append(1)
29linked_list.append(2)
30linked_list.append(3)