Menu
×
×
Correct!

Exercise:

Complete the code for the Linked List traversal function.

def traverseAndPrint(head): currentNode = head while currentNode: print(currentNode.data, end=" -> ") currentNode = currentNode.next print("null")

Not Correct

Click here to try again.

Correct!

Next ❯
def traverseAndPrint(head):
    currentNode = 
    while currentNode:
        print(currentNode.data, end=" -> ")
        currentNode = currentNode.
    print("null")

    
  




Log in to keep your progress
Sign up to keep your progress

Completed 0 of 43 Exercises:

DSA Get started
DSA Arrays
DSA Bubble Sort
DSA Selection Sort
DSA Quick Sort
DSA Counting Sort
DSA Radix Sort
DSA Linear Search
DSA Binary Search
DSA Linked Lists
DSA Stacks
DSA Queues
DSA Trees
DSA Binary Trees
DSA Binary Search Trees
DSA AVL Trees
DSA Graphs
DSA Cycle Detection
DSA Dijkstra
DSA Bellman-Ford

×

Reset the Score?

This will reset the score of ALL 43 exercises.

Are you sure you want to continue?



×

Congratulations!

You have finished all 43 DSA exercises.

Share your score: