Node Structure and Pointer Design in DSA Python - Time & Space Complexity

Time Complexity: Node Structure and Pointer Design

O(n)

Understanding Time Complexity

We want to understand how the design of a node and its pointers affects the time it takes to perform operations on linked data structures.

Specifically, how does the way nodes connect influence the speed of traversing or modifying the structure?

Scenario Under Consideration

Analyze the time complexity of the following node traversal code.

class Node:
    def __init__(self, value):
        self.value = value
        self.next = None

def traverse(head):
    current = head
    while current is not None:
        print(current.value)
        current = current.next

This code defines a simple node with a pointer to the next node and traverses the linked list from head to end.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Moving from one node to the next using the next pointer.
• How many times: Once for each node in the list until the end (n times for n nodes).

How Execution Grows With Input

As the number of nodes grows, the traversal takes longer because it visits each node once.

Input Size (n)	Approx. Operations
10	10 steps
100	100 steps
1000	1000 steps

Pattern observation: The number of steps grows directly with the number of nodes.

Final Time Complexity

Time Complexity: O(n)

This means the time to traverse the list grows linearly with the number of nodes.

Common Mistake

[X] Wrong: "Because each node points only to the next, traversal might be faster than visiting all nodes."

[OK] Correct: Even with simple pointers, you must visit each node once, so time grows with the list size.

Interview Connect

Understanding how node pointers affect traversal time helps you explain linked list operations clearly and confidently in interviews.

Self-Check

"What if each node had a pointer to both the next and previous nodes? How would that change the time complexity of traversal?"

Practice

1. What does the next pointer in a linked list node represent?

easy

A. It points to the previous node in the list

B. It stores the data value of the node

C. It points to the next node in the list

D. It stores the size of the list

Solution

1. Step 1: Understand the role of next pointer

   The next pointer in a linked list node is used to connect the current node to the following node in the sequence.

2. Step 2: Differentiate from other node parts

   The data part stores the value, and next specifically points to the next node, not previous or size.

3. Final Answer:

   It points to the next node in the list -> Option C

4. Quick Check:

   next pointer = next node address [OK]

Hint: Remember: next always leads forward in the list [OK]

Common Mistakes:

• Confusing next with data storage
• Thinking next points backward
• Assuming next stores list size

2. Which of the following is the correct way to define a simple node class in Python with a data attribute and a next pointer?

easy

A. class Node:
def __init__(self, data):
self.data = data
self.next = None

B. class Node:
def __init__(self, data):
data = self.data
next = None

C. class Node:
def __init__(self):
self.data = None
self.next = None

D. class Node:
def __init__(self, data, next):
self.data = data
next = None

Solution

1. Step 1: Check correct attribute assignment

   class Node: def __init__(self, data): self.data = data self.next = None correctly assigns self.data = data and initializes self.next = None to indicate no next node yet.

2. Step 2: Identify errors in other options

   class Node: def __init__(self, data): data = self.data next = None assigns backwards, class Node: def __init__(self): self.data = None self.next = None misses data parameter, class Node: def __init__(self, data, next): self.data = data next = None does not assign self.next properly.

3. Final Answer:

   class Node: def __init__(self, data): self.data = data self.next = None -> Option A

4. Quick Check:

   Correct attribute setup = class Node: def __init__(self, data): self.data = data self.next = None [OK]

Hint: Use self.attribute = value inside __init__ [OK]

Common Mistakes:

• Not using self to assign attributes
• Forgetting to initialize next to None
• Swapping assignment order

3. What will be the output of the following code?

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

head = Node(10)
second = Node(20)
head.next = second
print(head.next.data)

medium

A. 20

B. Error

C. None

D. 10

Solution

1. Step 1: Understand node creation and linking

   Two nodes are created: head with data 10, second with data 20. Then, head.next points to second.

2. Step 2: Trace the print statement

   head.next.data accesses the data of the node after head, which is second, so it prints 20.

3. Final Answer:

   20 -> Option A

4. Quick Check:

   head.next.data = 20 [OK]

Hint: Follow the next pointer to get next node's data [OK]

Common Mistakes:

• Printing head.data instead of head.next.data
• Confusing next pointer with data
• Expecting None because of uninitialized pointer

4. Identify the error in the following code snippet for a singly linked list node:

class Node:
    def __init__(self, data):
        self.data = data
        next = None

node1 = Node(5)
print(node1.next)

medium

A. The class name should be lowercase

B. The data attribute is missing

C. The print statement syntax is wrong

D. The next pointer is not assigned to self

Solution

1. Step 1: Check attribute assignment in __init__

   The code assigns next = None without self., so next is a local variable, not an attribute.

2. Step 2: Understand consequence on print

   Since node1.next was never set, it raises an AttributeError or prints None if accessed differently.

3. Final Answer:

   The next pointer is not assigned to self -> Option D

4. Quick Check:

   Missing self. causes attribute error [OK]

Hint: Always use self. to create object attributes [OK]

Common Mistakes:

• Forgetting self. before next
• Assuming local variable becomes attribute
• Ignoring error from missing attribute

5. You want to create a linked list with three nodes containing values 1, 2, and 3 respectively. Which code snippet correctly links the nodes?

hard

A. n1 = Node(1)
n2 = Node(2)
n3 = Node(3)
n1.next = n3
n3.next = n2
n2.next = None

B. n1 = Node(1)
n2 = Node(2)
n3 = Node(3)
n1.next = n2
n2.next = n3
n3.next = None

C. n1 = Node(1)
n2 = Node(2)
n3 = Node(3)
n1.next = None
n2.next = n1
n3.next = n2

D. n1 = Node(1)
n2 = Node(2)
n3 = Node(3)
n3.next = n2
n2.next = n1
n1.next = None

Solution

1. Step 1: Understand correct node linking order

   To create a linked list 1 -> 2 -> 3, n1.next should point to n2, and n2.next to n3. The last node n3.next should be None.

2. Step 2: Check each option's linking

   n1 = Node(1) n2 = Node(2) n3 = Node(3) n1.next = n2 n2.next = n3 n3.next = None correctly links nodes in order. The other options link nodes in wrong order or reverse.

3. Final Answer:

   n1.next = n2; n2.next = n3; n3.next = None -> Option B

4. Quick Check:

   Correct forward linking = n1 = Node(1) n2 = Node(2) n3 = Node(3) n1.next = n2 n2.next = n3 n3.next = None [OK]

Hint: Link nodes in order, last node points to None [OK]

Common Mistakes:

• Linking nodes in reverse order
• Not setting last node's next to None
• Mixing node references