Count the Number of Nodes in a Linked List Using Go

Examples

Approach to solve this problem

Step 1 − Define a method that accepts the head of the linked list.

Step 2 − Initialize a variable, count := 0.

Step 3 − Iterate the given linked list till it reaches the last node.

Step 4 − Increase the count by 1 in the loop.

Step 5 − Return count.

Example

 Live Demo

package main
import "fmt"
type Node struct {
   value int
   next *Node
}
func NewNode(value int, next *Node) *Node{
   var n Node
   n.value = value
   n.next = next
   return &n
}
func CountNodes(head *Node){
   fmt.Printf("Input Linked List is: ")
   count :=0
   temp := head
   for temp != nil {
      fmt.Printf("%d ", temp.value)
      temp = temp.next
      count += 1
   }
   fmt.Printf("\nNumber of nodes in the linked list is: %d\n", count)
}
func main(){
   head := NewNode(30, NewNode(10, NewNode(40, NewNode(40, nil))))
   CountNodes(head)
}

Output

Input Linked List is: 30 10 40 40
Number of nodes in the linked list is: 4