Data Structure & Algorithms

• Node (value | next-pointer)
• Node Chains (two/more nodes connecting with help of next-pointers)

public class Node
{
  public int Value { get; set; }
  public Node Next { get; set; }
}

Node first = new Node { Value = 3 };
Node middle = new Node { Value = 5 };
first.Next = middle;
Node last = new Node { Value = 9 };
middle.Next = last;

• Linked List
• Doubly Linked List