Archives
/
Data-Structures-with-Go
mirror of https://github.com/Dentrax/Data-Structures-with-Go
2
0
Fork 0
Code Issues Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
master
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Data-Structures-with-Go/linked-list-find-length
History
Furkan Türkal 0a1b753203 update readme & added image 7 years ago
..
resources update readme & added image 7 years ago
README.md update readme & added image 7 years ago
linked-list-find-length.go updated and added find-length 7 years ago

README.md

LinkedList Find Length Source

What It Is

What It Is

For example, the function should return 5 for linked list [1 -> 3 -> 1 -> 2 -> 1]

Preview Thumbnail

METHOD 1 (Iterative Solution)

    1. Initialize count as 0
    1. Initialize a node pointer, current = head.
    1. Do following while current is not NULL a) current = current -> next b) count++;
    1. Return count
  • Input: Linked List = [1 -> 3 -> 1 -> 2 -> 1]
  • Output: count of nodes is 5

Algorithm Complexity

Complexity Notation
Time Complexity O(n)