You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

786 B

Raw Blame History

LinkedList Find Length Source

What It Is

For example, the function should return 5 for linked list [1 -> 3 -> 1 -> 2 -> 1]

METHOD 1 (Iterative Solution)

1. Initialize count as 0
1. Initialize a node pointer, current = head.
1. Do following while current is not NULL a) current = current -> next b) count++;
1. Return count

Input: Linked List = [1 -> 3 -> 1 -> 2 -> 1]

Output: count of nodes is 5

Algorithm Complexity

Complexity	Notation
`Time Complexity`	`O(n)`