Sum of smaller elements of nodes in a linked list

Suppose that linked list combination of two data element which are contain in integer value. Sum the all smallest nodes value of this linked list.

We can solve this problem by iterator linked list node from head to last node and compare node value. Before write an algorithm to solve this problem consider following test cases

1) There is possible to linked list empty. In this situation display a message(linked list is empty).

2) There is possible to node are contain both same value. then add any one value of the resultant.

Suppose we are inserted the following ((3 9),(11 4),(3 3),(6 1),(2 9),(4 7) ) node in a sequence.

Here given code implementation process.

1) Sum of smaller elements of nodes in a linked list in java 2) Sum of smaller elements of nodes in a linked list in c++ 3) Sum of smaller elements of nodes in a linked list in c 4) Sum of smaller elements of nodes in a linked list in c# 5) Sum of smaller elements of nodes in a linked list in vb.net 6) Sum of smaller elements of nodes in a linked list in php 7) Sum of smaller elements of nodes in a linked list in node js 8) Sum of smaller elements of nodes in a linked list in python 9) Sum of smaller elements of nodes in a linked list in ruby 10) Sum of smaller elements of nodes in a linked list in scala 11) Sum of smaller elements of nodes in a linked list in swift 12) Sum of smaller elements of nodes in a linked list in kotlin 13) Sum of smaller elements of nodes in a linked list in golang 14) Sum of smaller elements of nodes in a linked list in typescript