linked-lists

CLASS Node DECLARE fruit : STRING DECLARE next : Node
ENDCLASS // Create nodes
DECLARE node1 : Node
DECLARE node2 : Node
DECLARE node3 : Node SET node1 = NEW Node
SET node2 = NEW Node
SET node3 = NEW Node // Assign fruit values
SET node1.fruit = "apple"
SET node2.fruit = "banana"
SET node3.fruit = "orange" // Connect nodes
SET node1.next = node2
SET node2.next = node3
SET node3.next = NULL

class Node: def __init__(self, fruit): self.fruit = fruit self.next = None # Create nodes
node1 = Node("apple")
node2 = Node("banana")
node3 = Node("orange") # Connect nodes
node1.next = node2
node2.next = node3

class Node { String fruit; Node next; Node(String fruit) { this.fruit = fruit; this.next = null; }
} public class LinkedListExample { public static void main(String[] args) { // Create nodes Node node1 = new Node("apple"); Node node2 = new Node("banana"); Node node3 = new Node("orange"); // Connect nodes node1.next = node2; node2.next = node3 }
}

// Start at the head of the list
DECLARE current : Node
SET current = node1 WHILE current != NULL OUTPUT current.fruit SET current = current.next
ENDWHILE

# Traverse the linked list

current = node1

while current is not None:

print(current.fruit)

current = current.next

// Traverse the linked list

current = node1;

while (current != null) {

System.out.println(current.fruit);

current = current.next;

// Create a new node
DECLARE newNode : Node
SET newNode = NEW Node
SET newNode.fruit = "orange"
SET newNode.next = NULL // If the list is empty
IF node1 = NULL THEN SET node1 = newNode
ELSE // Traverse to the end of the list DECLARE current : Node SET current = node1 WHILE current.next != NULL SET current = current.next ENDWHILE // Append the new node SET current.next = newNode
ENDIF

# Add "orange" to the end of the linked list
new_node = Node("orange")

if node1 is None:
# If the list was empty, make "orange" the head
node1 = new_node
else:
# Find the last node and append "orange" to it
current = node1
while current.next is not None:
current = current.next
current.next = new_node

// Add "orange" to the end of the linked list
Node new_node = new Node("orange");

if (node1 == null) {
// If the list was empty, make "orange" the head
node1 = new_node;
} else {
// Find the last node and append "orange" to it
current = node1;
while (current.next != null) {
current = current.next;
}
current.next = new_node;

}

// Start traversal from the head
DECLARE current : Node
DECLARE previous : Node SET current = node1
SET previous = NULL WHILE current != NULL IF current.fruit = "apple" THEN IF previous = NULL THEN // "apple" is at the head of the list SET node1 = current.next ELSE // Bypass the current node SET previous.next = current.next ENDIF BREAK ENDIF SET previous = current SET current = current.next
ENDWHILE

# Find and remove "apple"

while current is not None:

if current.fruit == "apple":

if previous is None:

# If "apple" is the first node, update the head

node1 = current.next

else:

# Remove the node by updating the previous node's next pointer

previous.next = current.next

break

previous = current

current = current.next

// Find and remove "apple"

 while (current != null) {

if (current.fruit.equals("apple")) {

if (previous == null) {

// If "apple" is the first node, update the head

node1 = current.next;

} else {

// Remove the node by updating the previous node's next pointer

previous.next = current.next;

}

break;

}

previous = current;

current = current.next;

}