Find the largest node in Doubly linked list

Suppose that given linked list is combination of integer value. we are need to find largest node of this doubly linked list. We can solve this problem by using linked list traversal from front node to last node.

Process: When linked list is not empty then use one integer variable and assign front node value to this integer variable. Using of linked list pointer iterates linked list nodes are one by one visiting upcoming nodes. And check that linked list element value are greater than integer variable values. Then assign this value to resultant variable. This process are execute until not found last linked list node. This process are time complexity is O(n).

Suppose we are inserted the following (14, 31, 12, 15, 11, 25 ) node in a sequence.

Here given code implementation process.

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