- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Golang program to count the number of nodes in a doubly linked list.
Examples
Approach
Step 1 − Define a method that accepts the head of a doubly linked list.
Step 2 − Initialize temp:=head, count:=0
Step 3 − Iterate temp until it becomes nil.
Step 4 − Increase count by 1.
Step 5 − At the end, print count.
Example
package main import "fmt" type Node struct { prev *Node value int next *Node } func CreateNewNode(value int) *Node{ var node Node node.next = nil node.value = value node.prev = nil return &node } func TraverseDoublyLL(head * Node){ // Forward Traversal fmt.Printf("Doubly Linked List: ") count := 0 temp := head for temp!= nil{ fmt.Printf("%d ", temp.value) temp = temp.next count++ } fmt.Printf("\nTotal number of nodes: %d", count) } func main(){ // 10 <−> 20 <−> 30 <−> 40 head := CreateNewNode(10) node_2 := CreateNewNode(20) node_3 := CreateNewNode(30) node_4 := CreateNewNode(40) head.next = node_2 node_2.prev = head node_2.next = node_3 node_3.prev = node_2 node_3.next = node_4 node_4.prev = node_3 TraverseDoublyLL(head) }
Output
Doubly Linked List: 10 20 30 40 Total number of nodes: 4
Advertisements