The Royal Coding
Binary Search Bubble Sort Build A Max Heap Build A Min Heap Graph Traversal Heap Sort Implementing A Basic Hash Table Implementing A Binary Search Tree Implementing A Queue Implementing A Stack Insertion Sort Length Of Linked List Linear Search Linked Lists Merge A Two Sorted Linked List Merge Sort Quick Sort Redix Sort Reverse A Linked List Selection Sort Ternary Search Suffix Automata Construction

Python/C/C++/JAVA

Advanced Practice Programs with Code and Concept

By D.S

Length of Linked List

(a.) C Code

#include <stdio.h>
      #include <stdlib.h>
      
      struct Node {
          int data;
          struct Node* next;
      };
      
      void push(struct Node** head_ref, int new_data) {
          struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));
          new_node->data = new_data;
          new_node->next = (*head_ref);
          (*head_ref) = new_node;
      }
      
      int getLength(struct Node* head) {
          int count = 0;
          struct Node* current = head;
          while (current != NULL) {
              count++;
              current = current->next;
          }
          return count;
      }
      
      int main() {
          struct Node* head = NULL;
          push(&head, 1);
          push(&head, 2);
          push(&head, 3);
          push(&head, 4);
          push(&head, 5);
      
          printf("Length of linked list is %d
", getLength(head));
      
          return 0;
      }
Output:-
Length of linked list is 5

(b.) C++ Code

#include <iostream>
      using namespace std;
      
      class Node {
      public:
          int data;
          Node* next;
      };
      
      void push(Node** head_ref, int new_data) {
          Node* new_node = new Node();
          new_node->data = new_data;
          new_node->next = (*head_ref);
          (*head_ref) = new_node;
      }
      
      int getLength(Node* head) {
          int count = 0;
          Node* current = head;
          while (current != NULL) {
              count++;
              current = current->next;
          }
          return count;
      }
      
      int main() {
          Node* head = NULL;
          push(&head, 1);
          push(&head, 2);
          push(&head, 3);
          push(&head, 4);
          push(&head, 5);
      
          cout << "Length of linked list is " << getLength(head) << endl;
      
          return 0;
      }
Output:-
Length of linked list is 5

(c.) Python Code

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

class LinkedList:
    def __init__(self):
        self.head = None

    def push(self, new_data):
        new_node = Node(new_data)
        new_node.next = self.head
        self.head = new_node

    def get_length(self):
        count = 0
        current = self.head
        while current:
            count += 1
            current = current.next
        return count

# Testing the LinkedList class
llist = LinkedList()
llist.push(1)
llist.push(2)
llist.push(3)
llist.push(4)
llist.push(5)

print("Length of linked list is", llist.get_length())
Output:-
Length of linked list is 5

(d.) Java Code

class Node {
      int data;
      Node next;
  
      Node(int d) {
          data = d;
          next = null;
      }
  }
  
  class LinkedList {
      Node head;
  
      void push(int new_data) {
          Node new_node = new Node(new_data);
          new_node.next = head;
          head = new_node;
      }
  
      int getLength() {
          int count = 0;
          Node current = head;
          while (current != null) {
              count++;
              current = current.next;
          }
          return count;
      }
  
      public static void main(String[] args) {
          LinkedList llist = new LinkedList();
          llist.push(1);
          llist.push(2);
          llist.push(3);
          llist.push(4);
          llist.push(5);
  
          System.out.println("Length of linked list is " + llist.getLength());
      }
  }
Output:-
Length of linked list is 5

How did you feel about this post?

😍 🙂 😐 😕 😡

Was this helpful?

👍 👎