Find average of all nodes in a linked list

Here given code implementation process.

// C Program 
// Find average of all nodes in a linked list
#include <stdio.h>

#include <stdlib.h> //for malloc function

//Linked List Node
struct Node
{
	int data;
	struct Node *next;
};
//Create a node of linked list
struct Node *create_node(int data)
{
	//Create dynamic node
	struct Node *node = (struct Node *) malloc(sizeof(struct Node));
	if (node == NULL)
	{
		printf("Memory overflow\n");
	}
	else
	{
		//Set initial node value
		node->data = data;
		node->next = NULL;
	}
	return node;
}
//Add new node at end of linked list 
void add_node(struct Node **head, int data)
{
	struct Node *node = create_node(data);
	if ( *head == NULL)
	{
		*head = node;
	}
	else
	{
		struct Node *temp = *head;
		//Find last node
		while (temp->next != NULL)
		{
			temp = temp->next;
		}
		//Add node at last position
		temp->next = node;
	}
}
//Display linked list element
void display(struct Node *head)
{
	if (head == NULL)
	{
		printf("\n Empty linked list\n");
		return;
	}
	struct Node *temp = head;
	//iterating linked list elements
	while (temp != NULL)
	{
		if (temp != head)
		{
			printf(" →");
		}
		printf(" %d", temp->data);
		//visit to next node
		temp = temp->next;
	}
	printf(" → NULL\n");
}
//Calculate average of linked list nodes
void find_average(struct Node *head)
{
	if (head == NULL)
	{
		printf("\n Empty linked List");
	}
	else
	{
		printf(" Linked Linked \n");
		display(head);
		// Define useful resultant variable
		double sum = 0;
		int size = 0;
		// Get first node of linked list
		struct Node *auxiliary = head;
		// iterating linked list elements
		while (auxiliary != NULL)
		{
			//Node counter
			size++;
			//Calculate the sum of node value
			sum += auxiliary->data;
			// Visit to next node
			auxiliary = auxiliary->next;
		}
		//Display result
		if (sum != 0)
		{
			printf(" Node Average : %lf \n", (sum / size));
		}
		else
		{
			printf(" Node Average : 0\n");
		}
	}
}
int main()
{
	struct Node *head = NULL;
	// Add linked list node
	// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	add_node( &head, 2);
	add_node( &head, 9);
	add_node( &head, 1);
	add_node( &head, 5);
	add_node( &head, 5);
	add_node( &head, 4);
	add_node( &head, 3);
	add_node( &head, 7);
	find_average(head);
	return 0;
}

Output

 Linked Linked
 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.500000
// Java Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node
{
	public int data;
	public Node next;
	public Node(int data)
	{
		//Set node value
		this.data = data;
		this.next = null;
	}
}
class MyLinkedList
{
	public Node head;
	public Node tail;
	//Class constructor
	public MyLinkedList()
	{
		this.head = null;
		this.tail = null;
	}
	//insert node at last of linke list
	public void add_node(int data)
	{
		//Create a node
		Node node = new Node(data);
		if (this.head == null)
		{
			//When linked list empty add first node
			this.head = node;
			this.tail = node;
		}
		else
		{
			//Add new node at end of linked list
			this.tail.next = node;
			this.tail = node;
		}
	}
	//Display linked list element
	public void display()
	{
		if (this.head == null)
		{
			System.out.print("\nEmpty linked list\n");
			return;
		}
		Node temp = this.head;
		System.out.print("Linked List : ");
		//iterating linked list elements
		while (temp != null)
		{
			if (temp != this.head)
			{
				System.out.print(" →");
			}
			System.out.print(" " + temp.data);
			//visit to next node
			temp = temp.next;
		}
		System.out.print(" → NULL\n");
	}
	//Calculate average of linked list nodes
	public void find_average()
	{
		if (this.head == null)
		{
			System.out.print("\nEmpty linked List");
		}
		else
		{
			System.out.print(" Linked Linked \n");
			this.display();
			// Define useful resultant variable
			double sum = 0;
			int size = 0;
			// Get first node of linked list
			Node auxiliary = this.head;
			// iterating linked list elements
			while (auxiliary != null)
			{
				//Node counter
				size++;
				//Calculate the sum of node value
				sum += auxiliary.data;
				// Visit to next node
				auxiliary = auxiliary.next;
			}
			//Display result
			if (sum != 0)
			{
				System.out.print(" Node Average : " + (sum / size) + " \n");
			}
			else
			{
				System.out.print(" Node Average : 0\n");
			}
		}
	}
	public static void main(String[] args)
	{
		MyLinkedList obj = new MyLinkedList();
		// Add linked list node
		// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
		obj.add_node(2);
		obj.add_node(9);
		obj.add_node(1);
		obj.add_node(5);
		obj.add_node(5);
		obj.add_node(4);
		obj.add_node(3);
		obj.add_node(7);
		obj.find_average();
	}
}

Output

 Linked Linked
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5
//Include header file
#include <iostream>

using namespace std;
// C++ Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node
{
	public: int data;
	Node *next;
	Node(int data)
	{
		//Set node value
		this->data = data;
		this->next = NULL;
	}
};
class MyLinkedList
{
	public: Node *head;
	Node *tail;
	//Class constructor
	MyLinkedList()
	{
		this->head = NULL;
		this->tail = NULL;
	}
	//insert node at last of linke list
	void add_node(int data)
	{
		//Create a node
		Node *node = new Node(data);
		if (this->head == NULL)
		{
			//When linked list empty add first node
			this->head = node;
			this->tail = node;
		}
		else
		{
			//Add new node at end of linked list
			this->tail->next = node;
			this->tail = node;
		}
	}
	//Display linked list element
	void display()
	{
		if (this->head == NULL)
		{
			cout << "\nEmpty linked list\n";
			return;
		}
		Node *temp = this->head;
		cout << "Linked List : ";
		//iterating linked list elements
		while (temp != NULL)
		{
			if (temp != this->head)
			{
				cout << " →";
			}
			cout << " " << temp->data;
			//visit to next node
			temp = temp->next;
		}
		cout << " → NULL\n";
	}
	//Calculate average of linked list nodes
	void find_average()
	{
		if (this->head == NULL)
		{
			cout << "\nEmpty linked List";
		}
		else
		{
			cout << " Linked Linked \n";
			this->display();
			// Define useful resultant variable
			double sum = 0;
			int size = 0;
			// Get first node of linked list
			Node *auxiliary = this->head;
			// iterating linked list elements
			while (auxiliary != NULL)
			{
				//Node counter
				size++;
				//Calculate the sum of node value
				sum += auxiliary->data;
				// Visit to next node
				auxiliary = auxiliary->next;
			}
			//Display result
			if (sum != 0)
			{
				cout << " Node Average : " << (sum / size) << " \n";
			}
			else
			{
				cout << " Node Average : 0\n";
			}
		}
	}
};
int main()
{
	MyLinkedList obj = MyLinkedList();
	// Add linked list node
	// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	obj.add_node(2);
	obj.add_node(9);
	obj.add_node(1);
	obj.add_node(5);
	obj.add_node(5);
	obj.add_node(4);
	obj.add_node(3);
	obj.add_node(7);
	obj.find_average();
	return 0;
}

Output

 Linked Linked
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5
//Include namespace system
using System;
// C# Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node
{
	public int data;
	public Node next;
	public Node(int data)
	{
		//Set node value
		this.data = data;
		this.next = null;
	}
}
class MyLinkedList
{
	public Node head;
	public Node tail;
	//Class constructor
	public MyLinkedList()
	{
		this.head = null;
		this.tail = null;
	}
	//insert node at last of linke list
	public void add_node(int data)
	{
		//Create a node
		Node node = new Node(data);
		if (this.head == null)
		{
			//When linked list empty add first node
			this.head = node;
			this.tail = node;
		}
		else
		{
			//Add new node at end of linked list
			this.tail.next = node;
			this.tail = node;
		}
	}
	//Display linked list element
	public void display()
	{
		if (this.head == null)
		{
			Console.Write("\nEmpty linked list\n");
			return;
		}
		Node temp = this.head;
		Console.Write("Linked List : ");
		//iterating linked list elements
		while (temp != null)
		{
			if (temp != this.head)
			{
				Console.Write(" →");
			}
			Console.Write(" " + temp.data);
			//visit to next node
			temp = temp.next;
		}
		Console.Write(" → NULL\n");
	}
	//Calculate average of linked list nodes
	public void find_average()
	{
		if (this.head == null)
		{
			Console.Write("\nEmpty linked List");
		}
		else
		{
			Console.Write(" Linked Linked \n");
			this.display();
			// Define useful resultant variable
			double sum = 0;
			int size = 0;
			// Get first node of linked list
			Node auxiliary = this.head;
			// iterating linked list elements
			while (auxiliary != null)
			{
				//Node counter
				size++;
				//Calculate the sum of node value
				sum += auxiliary.data;
				// Visit to next node
				auxiliary = auxiliary.next;
			}
			//Display result
			if (sum != 0)
			{
				Console.Write(" Node Average : " + (sum / size) + " \n");
			}
			else
			{
				Console.Write(" Node Average : 0\n");
			}
		}
	}
	public static void Main(String[] args)
	{
		MyLinkedList obj = new MyLinkedList();
		// Add linked list node
		// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
		obj.add_node(2);
		obj.add_node(9);
		obj.add_node(1);
		obj.add_node(5);
		obj.add_node(5);
		obj.add_node(4);
		obj.add_node(3);
		obj.add_node(7);
		obj.find_average();
	}
}

Output

 Linked Linked
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5
<?php
// Php Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node
{
	public $data;
	public $next;

	function __construct($data)
	{
		//Set node value
		$this->data = $data;
		$this->next = null;
	}
}
class MyLinkedList
{
	public $head;
	public $tail;
	//Class constructor
	function __construct()
	{
		$this->head = null;
		$this->tail = null;
	}
	//insert node at last of linke list
	public	function add_node($data)
	{
		//Create a node
		$node = new Node($data);
		if ($this->head == null)
		{
			//When linked list empty add first node
			$this->head = $node;
			$this->tail = $node;
		}
		else
		{
			//Add new node at end of linked list
			$this->tail->next = $node;
			$this->tail = $node;
		}
	}
	//Display linked list element
	public	function display()
	{
		if ($this->head == null)
		{
			echo "\nEmpty linked list\n";
			return;
		}
		$temp = $this->head;
		echo "Linked List : ";
		//iterating linked list elements
		while ($temp != null)
		{
			if ($temp != $this->head)
			{
				echo " →";
			}
			echo " ". $temp->data;
			//visit to next node
			$temp = $temp->next;
		}
		echo " → NULL\n";
	}
	//Calculate average of linked list nodes
	public	function find_average()
	{
		if ($this->head == null)
		{
			echo "\nEmpty linked List";
		}
		else
		{
			echo " Linked Linked \n";
			$this->display();
			// Define useful resultant variable
			$sum = 0;
			$size = 0;
			// Get first node of linked list
			$auxiliary = $this->head;
			// iterating linked list elements
			while ($auxiliary != null)
			{
				//Node counter
				$size++;
				//Calculate the sum of node value
				$sum += $auxiliary->data;
				// Visit to next node
				$auxiliary = $auxiliary->next;
			}
			//Display result
			if ($sum != 0)
			{
				echo " Node Average : ". (($sum / $size)) ." \n";
			}
			else
			{
				echo " Node Average : 0\n";
			}
		}
	}
}

function main()
{
	$obj = new MyLinkedList();
	// Add linked list node
	// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	$obj->add_node(2);
	$obj->add_node(9);
	$obj->add_node(1);
	$obj->add_node(5);
	$obj->add_node(5);
	$obj->add_node(4);
	$obj->add_node(3);
	$obj->add_node(7);
	$obj->find_average();
}
main();

Output

 Linked Linked
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5
// Node Js Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node
{
	constructor(data)
	{
		//Set node value
		this.data = data;
		this.next = null;
	}
}
class MyLinkedList
{
	//Class constructor
	constructor()
	{
		this.head = null;
		this.tail = null;
	}
	//insert node at last of linke list
	add_node(data)
	{
		//Create a node
		var node = new Node(data);
		if (this.head == null)
		{
			//When linked list empty add first node
			this.head = node;
			this.tail = node;
		}
		else
		{
			//Add new node at end of linked list
			this.tail.next = node;
			this.tail = node;
		}
	}
	//Display linked list element
	display()
	{
		if (this.head == null)
		{
			process.stdout.write("\n Empty linked list\n");
			return;
		}
		var temp = this.head;
		process.stdout.write("Linked List : ");
		//iterating linked list elements
		while (temp != null)
		{
			if (temp != this.head)
			{
				process.stdout.write(" →");
			}
			process.stdout.write(" " + temp.data);
			//visit to next node
			temp = temp.next;
		}
		process.stdout.write(" → NULL\n");
	}
	//Calculate average of linked list nodes
	find_average()
	{
		if (this.head == null)
		{
			process.stdout.write("\n Empty linked List");
		}
		else
		{
			process.stdout.write(" Linked Linked \n");
			this.display();
			// Define useful resultant variable
			var sum = 0;
			var size = 0;
			// Get first node of linked list
			var auxiliary = this.head;
			// iterating linked list elements
			while (auxiliary != null)
			{
				//Node counter
				size++;
				//Calculate the sum of node value
				sum += auxiliary.data;
				// Visit to next node
				auxiliary = auxiliary.next;
			}
			//Display result
			if (sum != 0)
			{
				process.stdout.write(" Node Average : " + ((sum / size)) + " \n");
			}
			else
			{
				process.stdout.write(" Node Average : 0\n");
			}
		}
	}
}

function main()
{
	var obj = new MyLinkedList();
	// Add linked list node
	// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	obj.add_node(2);
	obj.add_node(9);
	obj.add_node(1);
	obj.add_node(5);
	obj.add_node(5);
	obj.add_node(4);
	obj.add_node(3);
	obj.add_node(7);
	obj.find_average();
}
main();

Output

 Linked Linked
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5
#  Python 3 Program
#  Find average of all nodes in a linked list

# Node of LinkedList
class Node :
	
	def __init__(self, data) :
		# Set node value
		self.data = data
		self.next = None
	

class MyLinkedList :
	
	# Class constructor
	def __init__(self) :
		self.head = None
		self.tail = None
	
	# insert node at last of linke list
	def add_node(self, data) :
		# Create a node
		node = Node(data)
		if (self.head == None) :
			# When linked list empty add first node
			self.head = node
			self.tail = node
		else :
			# Add new node at end of linked list
			self.tail.next = node
			self.tail = node
		
	
	# Display linked list element
	def display(self) :
		if (self.head == None) :
			print("\n Empty linked list\n", end = "")
			return
		
		temp = self.head
		print("Linked List : ", end = "")
		# iterating linked list elements
		while (temp != None) :
			if (temp != self.head) :
				print(" →", end = "")
			
			print(" ", temp.data, end = "")
			# visit to next node
			temp = temp.next
		
		print(" → NULL\n", end = "")
	
	# Calculate average of linked list nodes
	def find_average(self) :
		if (self.head == None) :
			print("\n Empty linked List", end = "")
		else :
			print(" Linked Linked \n", end = "")
			self.display()
			#  Define useful resultant variable
			sum = 0
			size = 0
			#  Get first node of linked list
			auxiliary = self.head
			#  iterating linked list elements
			while (auxiliary != None) :
				# Node counter
				size += 1
				# Calculate the sum of node value
				sum += auxiliary.data
				#  Visit to next node
				auxiliary = auxiliary.next
			
			# Display result
			if (sum != 0) :
				print(" Node Average : ", ((sum / size)) ," \n", end = "")
			else :
				print(" Node Average : 0\n", end = "")
			
		
	

def main() :
	obj = MyLinkedList()
	#  Add linked list node
	#  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	obj.add_node(2)
	obj.add_node(9)
	obj.add_node(1)
	obj.add_node(5)
	obj.add_node(5)
	obj.add_node(4)
	obj.add_node(3)
	obj.add_node(7)
	obj.find_average()

if __name__ == "__main__": main()

Output

 Linked Linked
Linked List :   2 →  9 →  1 →  5 →  5 →  4 →  3 →  7 → NULL
 Node Average :  4.5
#  Ruby Program
#  Find average of all nodes in a linked list

# Node of LinkedList
class Node 

	# Define the accessor and reader of class Node  
	attr_reader :data, :next
	attr_accessor :data, :next
    
	def initialize(data)
		# Set node value
		self.data = data
		self.next = nil
	end
end
class MyLinkedList 

	# Define the accessor and reader of class MyLinkedList  
	attr_reader :head, :tail
	attr_accessor :head, :tail

	# Class constructor
	def initialize()
		self.head = nil
		self.tail = nil
	end
	# insert node at last of linke list
	def add_node(data)
	
		# Create a node
		node = Node.new(data)
		if (self.head == nil)
		
			# When linked list empty add first node
			self.head = node
			self.tail = node
		else
		
			# Add new node at end of linked list
			self.tail.next = node
			self.tail = node
		end
	end
	# Display linked list element
	def display()
	
		if (self.head == nil)
		
			print("\n Empty linked list\n")
			return
		end
		temp = self.head
		print("Linked List : ")
		# iterating linked list elements
		while (temp != nil)
		
			if (temp != self.head)
			
				print(" →")
			end
			print(" ", temp.data)
			# visit to next node
			temp = temp.next
		end
		print(" → NULL\n")
	end
	# Calculate average of linked list nodes
	def find_average()
	
		if (self.head == nil)
		
			print("\n Empty linked List")
		else
		
			print(" Linked Linked \n")
			self.display()
			#  Define useful resultant variable
			sum = 0.0
			size = 0
			#  Get first node of linked list
			auxiliary = self.head
			#  iterating linked list elements
			while (auxiliary != nil)
			
				# Node counter
				size += 1
				# Calculate the sum of node value
				sum += auxiliary.data
				#  Visit to next node
				auxiliary = auxiliary.next
			end
			# Display result
			if (sum != 0)
			
				print(" Node Average : ", (sum / size) ," \n")
			else
			
				print(" Node Average : 0\n")
			end
		end
	end
end
def main()

	obj = MyLinkedList.new()
	#  Add linked list node
	#  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	obj.add_node(2)
	obj.add_node(9)
	obj.add_node(1)
	obj.add_node(5)
	obj.add_node(5)
	obj.add_node(4)
	obj.add_node(3)
	obj.add_node(7)
	obj.find_average()
end
main()

Output

 Linked Linked 
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5 
// Scala Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node(var data: Int,
	var next: Node)
{
	def this(data: Int)
	{
		this(data, null);
	}
}
class MyLinkedList(var head: Node,
	var tail: Node)
{
	//Class constructor
	def this()
	{
		this(null, null);
	}
	//insert node at last of linke list
	def add_node(data: Int): Unit = {
		//Create a node
		var node: Node = new Node(data);
		if (this.head == null)
		{
			//When linked list empty add first node
			this.head = node;
			this.tail = node;
		}
		else
		{
			//Add new node at end of linked list
			this.tail.next = node;
			this.tail = node;
		}
	}
	//Display linked list element
	def display(): Unit = {
		if (this.head == null)
		{
			print("\n Empty linked list\n");
			return;
		}
		var temp: Node = this.head;
		print("Linked List : ");
		//iterating linked list elements
		while (temp != null)
		{
			if (temp != this.head)
			{
				print(" →");
			}
			print(" " + temp.data);
			//visit to next node
			temp = temp.next;
		}
		print(" → NULL\n");
	}
	//Calculate average of linked list nodes
	def find_average(): Unit = {
		if (this.head == null)
		{
			print("\n Empty linked List");
		}
		else
		{
			print(" Linked Linked \n");
			this.display();
			// Define useful resultant variable
			var sum: Double = 0;
			var size: Int = 0;
			// Get first node of linked list
			var auxiliary: Node = this.head;
			// iterating linked list elements
			while (auxiliary != null)
			{
				//Node counter
				size += 1;
				//Calculate the sum of node value
				sum += auxiliary.data;
				// Visit to next node
				auxiliary = auxiliary.next;
			}
			//Display result
			if (sum != 0)
			{
				print(" Node Average : " + (sum / size) + " \n");
			}
			else
			{
				print(" Node Average : 0\n");
			}
		}
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		var obj: MyLinkedList = new MyLinkedList();
		// Add linked list node
		// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
		obj.add_node(2);
		obj.add_node(9);
		obj.add_node(1);
		obj.add_node(5);
		obj.add_node(5);
		obj.add_node(4);
		obj.add_node(3);
		obj.add_node(7);
		obj.find_average();
	}
}

Output

 Linked Linked
Linked List :  2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
 Node Average : 4.5
// Swift 4 Program
// Find average of all nodes in a linked list

//Node of LinkedList
class Node
{
	var data: Int;
	var next: Node? ;
	init(_ data: Int)
	{
		//Set node value
		self.data = data;
		self.next = nil;
	}
}
class MyLinkedList
{
	var head: Node? ;
	var tail: Node? ;
	//Class constructor
	init()
	{
		self.head = nil;
		self.tail = nil;
	}
	//insert node at last of linke list
	func add_node(_ data: Int)
	{
		//Create a node
		let node: Node? = Node(data);
		if (self.head == nil)
		{
			//When linked list empty add first node
			self.head = node;
			self.tail = node;
		}
		else
		{
			//Add new node at end of linked list
			self.tail!.next = node;
			self.tail = node;
		}
	}
	//Display linked list element
	func display()
	{
		if (self.head == nil)
		{
			print("\n Empty linked list\n", terminator: "");
			return;
		}
		var temp: Node? = self.head;
		print("Linked List : ", terminator: "");
		//iterating linked list elements
		while (temp != nil)
		{
			if (!(temp === self.head))
			{
				print(" →", terminator: "");
			}
			print(" ", temp!.data, terminator: "");
			//visit to next node
			temp = temp!.next;
		}
		print(" → NULL\n", terminator: "");
	}
	//Calculate average of linked list nodes
	func find_average()
	{
		if (self.head == nil)
		{
			print("\n Empty linked List", terminator: "");
		}
		else
		{
			print(" Linked Linked \n", terminator: "");
			self.display();
			// Define useful resultant variable
			var sum: Double = 0;
			var size: Int = 0;
			// Get first node of linked list
			var auxiliary: Node? = self.head;
			// iterating linked list elements
			while (auxiliary != nil)
			{
				//Node counter
				size += 1;
				//Calculate the sum of node value
				sum += Double(auxiliary!.data);
				// Visit to next node
				auxiliary = auxiliary!.next;
			}
			//Display result
			if (sum != 0)
			{
				print(" Node Average : ", (sum / Double(size)) ," \n", terminator: "");
			}
			else
			{
				print(" Node Average : 0\n", terminator: "");
			}
		}
	}
}
func main()
{
	let obj: MyLinkedList = MyLinkedList();
	// Add linked list node
	// 2 → 9 → 1 → 5 → 5 → 4 → 3 → 7 → NULL
	obj.add_node(2);
	obj.add_node(9);
	obj.add_node(1);
	obj.add_node(5);
	obj.add_node(5);
	obj.add_node(4);
	obj.add_node(3);
	obj.add_node(7);
	obj.find_average();
}
main();

Output

 Linked Linked
Linked List :   2 →  9 →  1 →  5 →  5 →  4 →  3 →  7 → NULL
 Node Average :  4.5


Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment







© 2021, kalkicode.com, All rights reserved