Create linked list from an given array

Create linked list from an given array

Here given code implementation process.

//C Program
//Create linked list from an given array
#include <stdio.h>
#include <stdlib.h> //for malloc function

//create structure
struct Node
{
  int data;
  struct Node*next;
};

//insert Node element
void insert(struct Node**head,int value)
{
  //Create dynamic node
  struct Node*node=(struct Node*)malloc(sizeof(struct Node));
  if(node==NULL)
  {
    printf("Memory overflow\n");
  }else
  {
    node->data=value;
    node->next=NULL;
    if(*head==NULL)
    {
      *head=node;
    }else
    {

      struct Node*temp=*head;
      //find last node
      while(temp->next!=NULL)
      {
        temp=temp->next;
      }
      //add node at last possition
      temp->next=node;
    }
  }
}
//Display element of Node
void display(struct Node*temp)
{
  
  if(temp==NULL)
  {
    printf("Empty linked list");
  }
  while(temp!=NULL)
  {
    printf("%d  ",temp->data);
    temp=temp->next;
  }
}
int main(){
  //create node pointer
  struct Node*head=NULL;

  int arr[]={6,2,5,1,8,9,3};

  int size = sizeof(arr)/sizeof(arr[0]);

  //insert element of linked list
  for (int i = 0; i < size; ++i)
  {
    insert(&head,arr[i]);
  }
  
  //display all node
  display(head);
  return 0;
}

Output

6  2  5  1  8  9  3
//C++ Program 
//Create linked list from an given array
#include <iostream>
using namespace std;

//Create structure
struct Node
{
  int data;
  struct Node*next;
};
class LinkedList
{

public:
  Node*head;//head node
  LinkedList();
  void insert(int);
  void display();
};
LinkedList::LinkedList()
{
  head=NULL;
}
//insert node at end of linked list
void LinkedList::insert(int value)
{
  //Create dynamic node
  Node*node=new Node;
  if(node==NULL)
  {
    cout<<"Memory overflow\n";
  }else
  {
    node->data=value;
    node->next=NULL;
    if(head==NULL)
    {
      //base condition
      head=node;
    }else
    {
      Node*temp=head;
      while(temp->next!=NULL)
      {
        temp=temp->next;
      }
      //add newly node at last
      temp->next=node;
    }
  }
}
//display all node value in linked list
void LinkedList:: display()
{
  if(head==NULL)
  {
    cout<<"Empty linked list";
  }
  else
  {
    Node*temp=head;
    cout<<"Linked List : ";
    while(temp!=NULL)
    {
      //print node value
      cout<<temp->data<<" ";
      temp=temp->next;
    }
  }
}


int main()
{

  //create object
  LinkedList obj;

  int arr[]={6,2,5,1,8,9,3};

  int size = sizeof(arr)/sizeof(arr[0]);

  //insert element of linked list
  for (int i = 0; i < size; ++i)
  {
    obj.insert(arr[i]);
  }


  obj.display();
  return 0;
}

Output

Linked List : 6 2 5 1 8 9 3 
//Java program
//Create linked list from an given array
public class LinkedList
{

  static class Node
  {
    int data;
    Node next;
  }
  public Node head;
  //Class constructors
  LinkedList()
  {
    head=null;
  } 
  //insert  element
  public void insert(int value)
  {
    //Create  node
    Node node=new Node();
    node.data=value;
    node.next=null;
    if(head==null) head=node;
    else
    {
      Node temp=head;
      //find last node
      while(temp.next!=null)
      {
        temp=temp.next;
      }
      temp.next=node;
    }
    
  }
  //Display all Linked List elements
  public void display()
  {
    if(head!=null)
    {
      System.out.print("Linked List Element :");
      Node temp=head;
      while(temp!=null)
      {
        System.out.print("  "+temp.data);
        temp=temp.next;
      }
      System.out.println();
    }else
    {
      System.out.println("Empty Linked list"); 
    }
  }


  public static void main(String[] args) 
  {

    LinkedList obj = new LinkedList();
    int []arr={6,2,5,1,8,9,3};
    for (int i=0;i<arr.length ;i++ )
    {
      obj.insert(arr[i]);  
    }
    obj.display();
  }
}

Output

Linked List Element :  6  2  5  1  8  9  3
#Python Program 
#Create linked list from an given array
class Node:
  def __init__(self,data):
    self.data=data
    self.next=None

#create class Linked    
class LinkedList:

  def __init__(self):

    #Assign default value
    self.head=None

  #insert new node to Linked  
  def insert(self,data):

    node=Node(data)

    if(self.head==None):
      #first element of linked list
      self.head=node
    else:
    
      temp=self.head
      #find middle node of linked list
      while(temp!=None and temp.next!=None ):
        temp=temp.next
      
      #add at last of linked list  
      temp.next=node 
   

  #display all linked list node 
  def display(self):
    temp=self.head
    while(temp!=None):
      print(temp.data,end=" ")
      temp=temp.next
    print()

  

def main():
  obj = LinkedList()
  arr = [6,2,5,1,8,9,3]
  for x in arr :
    obj.insert(x)

  obj.display()

if __name__ =="__main__":
  main()

Output

6 2 5 1 8 9 3 
//C# program
//Create linked list from an given array
using System;
public class Node
{
  public int data;
  public Node next;
}
public class LinkedList
{


  public Node head;
  //Class constructors
  LinkedList()
  {
    head=null;
  } 
  //insert  element
  public void insert(int value)
  {
    //Create  node
    Node node=new Node();
    node.data=value;
    node.next=null;
    if(head==null) head=node;
    else
    {
      Node temp=head;
      //find last node
      while(temp.next!=null)
      {
        temp=temp.next;
      }
      temp.next=node;
    }

  }
  //Display all Linked List elements
  public void display()
  {
    if(head!=null)
    {
      Console.WriteLine("Linked List Element :");
      Node temp=head;
      while(temp!=null)
      {
        Console.Write("  "+temp.data);
        temp=temp.next;
      }
      Console.WriteLine();
    }else
    {
      Console.WriteLine("Empty Linked list"); 
    }
  }


  public static void Main(String[] args) 
  {

    LinkedList obj = new LinkedList();
    int []arr={6,2,5,1,8,9,3};
    for (int i=0;i<arr.Length ;i++ )
    {
      obj.insert(arr[i]);  
    }
    obj.display();
  }
}

Output

Linked List Element :
  6  2  5  1  8  9  3
<?php
//Php program 
//Create linked list from an given array
class Node
{
  public $data;
  public $next;
  function __construct($data)
  {
    $this->data = $data;
    $this->next = NULL;
  }
}
class LinkedList
{

  public $head;
  function __construct()
  {
    $head=NULL;
  }
  /*
  * Append the Given data value at end of linked list
  * Fun : insert
  * Parm: data value
  *@return None
  */
  function insert($data)
  {
    $newNode=new Node($data); 

    if($this->head==NULL)
    {
      $this->head=$newNode;
    }
    else
    {
      $temp=$this->head;

      //find last node of linked list
      while($temp->next!=NULL)
      {
        $temp=$temp->next;
      }
      //add new node to last of linked list
      $temp->next=$newNode;
    }
  }
  //Display all inserted node in linked list
  function display()
  {
    if($this->head==NULL)
    {
      echo "Empty Linked List";
    }
    else
    {
      $temp=$this->head;
      echo "Linked List :";
      while($temp!=NULL)
      {
        //display node value
        echo "  ".$temp->data;
        $temp=$temp->next; //visit to next node
      }
    }   
  }
}
function main()
{
  //Make a object of LinkedList class
  $obj= new LinkedList();
  $arr=array(6,2,5,1,8,9,3);
  for ($i=0; $i < count($arr); $i++) 
  { 
    $obj->insert($arr[$i]);
  }
  $obj->display();
}
main();
?>

Output

Linked List :  6  2  5  1  8  9  3


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