Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Counting no.of nodes in list through recursion and iteration #882

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Counting no.of nodes in list through recursion and iteration #882

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
a5217e9
Create Counting no.of nodes in list through recursion and iteration.java
ShreyaDayma-cse Oct 1, 2021
2af849f
Create Counting number of nodes in list through recursion and iterati…
ShreyaDayma-cse Oct 1, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
67 changes: 67 additions & 0 deletions ...a-Structures/LinkedList/Counting no.of nodes in list through recursion and iteration.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,67 @@
: import java.util.*;
class LinkedList {
Node head;
static class Node {
int data;
Node next;
Node(int d) {
data = d;
next = null;
} }
public static LinkedList insert(LinkedList list, int data) {
Node new_node = new Node(data);
new_node.next = null;
if (list.head == null) {
list.head = new_node;
} else {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please format your code properly before you commit your next changes.

Node last = list.head;
while (last.next != null) {
last = last.next;
}
last.next = new_node; }
return list; }
public static void printlist(LinkedList list) {
Node temp = list.head;
System.out.println("Linked list:");
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
public static void count1(LinkedList list) {
Node temp = list.head;
int c = 0;
while (temp != null) {
c++;
temp = temp.next;
}
System.out.println("No.of nodes are: " + c);
}
public static int count2(Node node) {
if (node == null)
return 0;
else
return 1 + count2(node.next);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
LinkedList ll = new LinkedList();
ll = insert(ll, 2);
ll = insert(ll, 5);
ll = insert(ll, 6);
ll = insert(ll, 8);
ll = insert(ll, 1);
ll = insert(ll, 3);
printlist(ll);
System.out.println("Counting through iteration:");
count1(ll);
System.out.println();
System.out.println("Counting through recursion:");
int a = count2(ll.head);
if (a == 0)
System.out.println("Length of linked list= " + a);
else
System.out.println("Length of linked list= " + a);
}
}
67 changes: 67 additions & 0 deletions ...ructures/LinkedList/Counting number of nodes in list through recursion and iteration.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,67 @@
: import java.util.*;
class LinkedList {
Node head;
static class Node {
int data;
Node next;
Node(int d) {
data = d;
next = null;
} }
public static LinkedList insert(LinkedList list, int data) {
Node new_node = new Node(data);
new_node.next = null;
if (list.head == null) {
list.head = new_node;
} else {
Node last = list.head;
while (last.next != null) {
last = last.next;
}
last.next = new_node; }
return list; }
public static void printlist(LinkedList list) {
Node temp = list.head;
System.out.println("Linked list:");
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
public static void count1(LinkedList list) {
Node temp = list.head;
int c = 0;
while (temp != null) {
c++;
temp = temp.next;
}
System.out.println("No.of nodes are: " + c);
}
public static int count2(Node node) {
if (node == null)
return 0;
else
return 1 + count2(node.next);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
LinkedList ll = new LinkedList();
ll = insert(ll, 2);
ll = insert(ll, 5);
ll = insert(ll, 6);
ll = insert(ll, 8);
ll = insert(ll, 1);
ll = insert(ll, 3);
printlist(ll);
System.out.println("Counting through iteration:");
count1(ll);
System.out.println();
System.out.println("Counting through recursion:");
int a = count2(ll.head);
if (a == 0)
System.out.println("Length of linked list= " + a);
else
System.out.println("Length of linked list= " + a);
}
}