Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/java/util/linkedlist_push.htm below:

Java LinkedList push() Method

The Java LinkedList push(E e) method pushes an element E onto the stack represented by this linkedList. Essentially it add the element at the front of the LinkedList object.

Following is the declaration for java.util.LinkedList.push() method

public void push(E e)

e − The element to be pushed in the linkedList.

This method does not return any value.

NullPointerException − if the specified element is null.

The following example shows the usage of Java LinkedList push(E) method. In this example, we're using integers. As first, we'll add some items to the linkedList using add() method and then using push() method, we'll add elements to the stack. Then we're adding more elements using add() method again and the print the arraydeque to check if insertions in the linkedList are in the order we desired.

package com.tutorialspoint;

import java.util.LinkedList;

public class LinkedListDemo {
   public static void main(String[] args) {
      
      // create an empty linkedList
      LinkedList<Integer> linkedList = new LinkedList<>();

      // use add() method to add elements in the linkedList
      linkedList.add(4);
      linkedList.add(5);
      linkedList.add(6);

      // use push() method to add element at the front of the linkedList
      linkedList.push(3);
      linkedList.push(2);
      linkedList.push(1);//now, element 1 will be at the front

      // these elements will be added in continuation with linkedList.add(6)
      linkedList.add(7);
      linkedList.add(8);

      // let us print all the elements available in linkedList
      System.out.println("LinkedList = " + linkedList);
   }
}

Let us compile and run the above program, this will produce the following result −

LinkedList = [1, 2, 3, 4, 5, 6, 7, 8]

The following example shows the usage of Java LinkedList push(E) method. In this example, we're using strings. As first, we'll add some items to the linkedList using add() method and then using push() method, we'll add elements to the stack. Then we're adding more elements using add() method again and the print the arraydeque to check if insertions in the linkedList are in the order we desired.

package com.tutorialspoint;

import java.util.LinkedList;

public class LinkedListDemo {
   public static void main(String[] args) {
      
      // create an empty linkedList
      LinkedList<String> linkedList = new LinkedList<>();

      // use add() method to add elements in the linkedList
      linkedList.add("D");
      linkedList.add("E");
      linkedList.add("F");

      // use push() method to add element to the stack
      linkedList.push("C");
      linkedList.push("B");
      linkedList.push("A");//now, element A will be at the front

      // these elements will be added in continuation with linkedList.add("F")
      linkedList.add("G");
      linkedList.add("H");

      // let us print all the elements available in linkedList
      System.out.println("LinkedList = " + linkedList);
   }
}

Let us compile and run the above program, this will produce the following result −

LinkedList = [A, B, C, D, E, F, G, H]

The following example shows the usage of Java LinkedList push(E) method. In this example, we're using Student objects. As first, we'll add some items to the linkedList using add() method and then using push() method, we'll add elements to the front of the linkedList. Then we're adding more elements using add() method again and the print the arraydeque to check if insertions in the linkedList are in the order we desired.

package com.tutorialspoint;

import java.util.LinkedList;

public class LinkedListDemo {
   public static void main(String[] args) {

      // create an empty linkedList
      LinkedList<Student> linkedList = new LinkedList<>();

      // use add() method to add elements in the linkedList
      linkedList.add(new Student(4, "Julie"));
      linkedList.add(new Student(5, "Robert"));
      linkedList.add(new Student(6, "Adam"));

      // use push() method to add element to the stack
      linkedList.push(new Student(3, "Rohan"));
      linkedList.push(new Student(2, "Sohan"));
      linkedList.push(new Student(1, "Mohan"));//now, Student 1 will be at the front

      // these elements will be added in continuation with linkedList.add(new Student(6, "Adam"))
      linkedList.add(new Student(7, "Ali"));
      linkedList.add(new Student(8, "Ahmad"));

      // let us print all the elements available in linkedList
      System.out.println("LinkedList = " + linkedList);      
   }
}

class Student {
   int rollNo;
   String name;

   Student(int rollNo, String name){
      this.rollNo = rollNo;
      this.name = name;
   }

   @Override
   public String toString() {
      return "[ " + this.rollNo + ", " + this.name + " ]";
   }
}

Let us compile and run the above program, this will produce the following result −

LinkedList = [[ 1, Mohan ], [ 2, Sohan ], [ 3, Rohan ], [ 4, Julie ], [ 5, Robert ], [ 6, Adam ], [ 7, Ali ], [ 8, Ahmad ]]

java_util_linkedlist.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4