{"id":1259,"date":"2022-02-26T07:03:12","date_gmt":"2022-02-26T07:03:12","guid":{"rendered":"https:\/\/mdr.foobrdigital.com\/?p=1259"},"modified":"2022-02-26T07:03:12","modified_gmt":"2022-02-26T07:03:12","slug":"stack-class","status":"publish","type":"post","link":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/2022\/02\/26\/stack-class\/","title":{"rendered":"Stack Class"},"content":{"rendered":"\n

In this tutorial, we will learn about the Java Stack class and its methods with the help of examples.<\/p>\n\n\n\n

The Java collections framework has a class named Stack<\/code> that provides the functionality of the stack data structure.<\/p>\n\n\n\n

The Stack<\/code> class extends the Vector<\/code> class.<\/p>\n\n\n\n

\"Java<\/figure>\n\n\n\n
\n\n\n\n

Stack Implementation<\/h2>\n\n\n\n

In stack, elements are stored and accessed in Last In First Out<\/strong> manner. That is, elements are added to the top of the stack and removed from the top of the stack.<\/p>\n\n\n\n

\"Working<\/figure>\n\n\n\n
\n\n\n\n

Creating a Stack<\/h2>\n\n\n\n

In order to create a stack, we must import the java.util.Stack<\/code> package first. Once we import the package, here is how we can create a stack in Java.<\/p>\n\n\n\n

Stack<Type> stacks = new Stack<>();\n<\/code><\/pre>\n\n\n\n
Here, Type<\/code> indicates the stack’s type. For example,<\/p>\n\n\n\n
\/\/ Create Integer type stack\nStack<Integer> stacks = new Stack<>();\n\n\/\/ Create String type stack\nStack<String> stacks = new Stack<>();\n<\/code><\/pre>\n\n\n\n
\n\n\n\n
Stack Methods<\/h2>\n\n\n\n
Since\u00a0Stack<\/code>\u00a0extends the\u00a0Vector<\/code>\u00a0class, it inherits all the methods\u00a0Vector<\/code>.<\/p>\n\n\n\n
Besides these methods, the Stack<\/code> class includes 5 more methods that distinguish it from Vector<\/code>.<\/p>\n\n\n\n
\n\n\n\n
push() Method<\/h3>\n\n\n\n
To add an element to the top of the stack, we use the push()<\/code> method. For example,<\/p>\n\n\n\n
import java.util.Stack;\n\nclass Main {\n    public static void main(String[] args) {\n        Stack<String> animals= new Stack<>();\n\n        \/\/ Add elements to Stack\n        animals.push(\"Dog\");\n        animals.push(\"Horse\");\n        animals.push(\"Cat\");\n\n        System.out.println(\"Stack: \" + animals);\n    }\n}\n<\/code><\/pre>\n\n\n\n
Output<\/strong><\/p>\n\n\n\n
Stack: [Dog, Horse, Cat]\n<\/samp><\/code><\/pre>\n\n\n\n
\n\n\n\n
pop() Method<\/h3>\n\n\n\n
To remove an element from the top of the stack, we use the pop()<\/code> method. For example,<\/p>\n\n\n\n
import java.util.Stack;\n\nclass Main {\n    public static void main(String[] args) {\n        Stack<String> animals= new Stack<>();\n\n        \/\/ Add elements to Stack\n        animals.push(\"Dog\");\n        animals.push(\"Horse\");\n        animals.push(\"Cat\");\n        System.out.println(\"Initial Stack: \" + animals);\n\n        \/\/ Remove element stacks\n        String element = animals.pop();\n        System.out.println(\"Removed Element: \" + element);\n    }\n}\n<\/code><\/pre>\n\n\n\n
Output<\/strong><\/p>\n\n\n\n
Initial Stack: [Dog, Horse, Cat]\nRemoved Element: Cat\n<\/samp><\/code><\/pre>\n\n\n\n
\n\n\n\n
peek() Method<\/h3>\n\n\n\n
The peek()<\/code> method returns an object from the top of the stack. For example,<\/p>\n\n\n\n
import java.util.Stack;\n\nclass Main {\n    public static void main(String[] args) {\n        Stack<String> animals= new Stack<>();\n\n        \/\/ Add elements to Stack\n        animals.push(\"Dog\");\n        animals.push(\"Horse\");\n        animals.push(\"Cat\");\n        System.out.println(\"Stack: \" + animals);\n\n        \/\/ Access element from the top\n        String element = animals.peek();\n        System.out.println(\"Element at top: \" + element);\n\n    }\n}\n<\/code><\/pre>\n\n\n\n
Output<\/strong><\/p>\n\n\n\n
Stack: [Dog, Horse, Cat]\nElement at top: Cat\n<\/samp><\/code><\/pre>\n\n\n\n
\n\n\n\n
search() Method<\/h3>\n\n\n\n
To search an element in the stack, we use the search()<\/code> method. It returns the position of the element from the top of the stack. For example,<\/p>\n\n\n\n
import java.util.Stack;\n\nclass Main {\n    public static void main(String[] args) {\n        Stack<String> animals= new Stack<>();\n\n        \/\/ Add elements to Stack\n        animals.push(\"Dog\");\n        animals.push(\"Horse\");\n        animals.push(\"Cat\");\n        System.out.println(\"Stack: \" + animals);\n\n        \/\/ Search an element\n        int position = animals.search(\"Horse\");\n        System.out.println(\"Position of Horse: \" + position);\n    }\n}\n<\/code><\/pre>\n\n\n\n
Output<\/strong><\/p>\n\n\n\n
Stack: [Dog, Horse, Cat]\nPosition of Horse: 2\n<\/samp><\/code><\/pre>\n\n\n\n
\n\n\n\n
empty() Method<\/h3>\n\n\n\n
To check whether a stack is empty or not, we use the empty()<\/code> method. For example,<\/p>\n\n\n\n
import java.util.Stack;\n\nclass Main {\n    public static void main(String[] args) {\n        Stack<String> animals= new Stack<>();\n\n        \/\/ Add elements to Stack\n        animals.push(\"Dog\");\n        animals.push(\"Horse\");\n        animals.push(\"Cat\");\n        System.out.println(\"Stack: \" + animals);\n\n        \/\/ Check if stack is empty\n        boolean result = animals.empty();\n        System.out.println(\"Is the stack empty? \" + result);\n    }\n}\n<\/code><\/pre>\n\n\n\n
Output<\/strong><\/p>\n\n\n\n
Stack: [Dog, Horse, Cat]\nIs the stack empty? false\n<\/samp><\/code><\/pre>\n\n\n\n
\n\n\n\n
Use ArrayDeque Instead of Stack<\/h2>\n\n\n\n
The Stack<\/code> class provides the direct implementation of the stack data structure. However, it is recommended not to use it. Instead, use the ArrayDeque<\/code> class (implements the Deque<\/code> interface) to implement the stack data structure in Java.<\/p>\n","protected":false},"excerpt":{"rendered":"
In this tutorial, we will learn about the Java Stack class and its methods with the help of examples. The Java collections framework has a class named Stack that provides the functionality of the stack data structure. The Stack class extends the Vector class. Stack Implementation In stack, elements are stored and accessed in Last In First Out manner. That is, elements are […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[584],"tags":[],"_links":{"self":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/posts\/1259"}],"collection":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/comments?post=1259"}],"version-history":[{"count":0,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/posts\/1259\/revisions"}],"wp:attachment":[{"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/media?parent=1259"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/categories?post=1259"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mudassirbackup.infinitycodestudio.com\/index.php\/wp-json\/wp\/v2\/tags?post=1259"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}