Link stack : Stack « Collections Data Structure « Java

Java
1. 2D Graphics GUI
2. 3D
3. Advanced Graphics
4. Ant
5. Apache Common
6. Chart
7. Collections Data Structure
8. Database SQL JDBC
9. Design Pattern
10. Development Class
11. Email
12. Event
13. File Input Output
14. Game
15. Hibernate
16. J2EE
17. J2ME
18. JDK 6
19. JSP
20. JSTL
21. Language Basics
22. Network Protocol
23. PDF RTF
24. Regular Expressions
25. Security
26. Servlets
27. Spring
28. Swing Components
29. Swing JFC
30. SWT JFace Eclipse
31. Threads
32. Tiny Application
33. Velocity
34. Web Services SOA
35. XML
Microsoft Office Word 2007 Tutorial
Java Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
C# / C Sharp
C# / CSharp Tutorial
ASP.Net
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
PHP
Python
SQL Server / T-SQL
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Java » Collections Data Structure » StackScreenshots 
Link stack
Link stack

public class LinkStack {
  private LinkList list;

  public LinkStack() {
    list = new LinkList();
  }

  public void push(long j) {
    list.insertFirst(j);
  }

  public long pop() {
    return list.deleteFirst();
  }

  public boolean isEmpty() {
    return (list.isEmpty());
  }

  public void displayStack() {
    System.out.print("Stack: ");
    list.displayList();
  }

  public static void main(String[] args) {
    LinkStack theStack = new LinkStack();

    theStack.push(20);
    theStack.push(40);

    theStack.displayStack();

    theStack.push(60);
    theStack.push(80);

    theStack.displayStack();

    theStack.pop();
    theStack.pop();

    theStack.displayStack();
  }

  class LinkList {
    private Link first;

    public LinkList() {
      first = null;
    }

    public boolean isEmpty() {
      return (first == null);
    }

    public void insertFirst(long d) {
      Link newLink = new Link(d);
      newLink.next = first;
      first = newLink;
    }

    public long deleteFirst() {
      Link buf = first;
      first = first.next;
      return buf.data;
    }

    public void displayList() {
      Link current = first;
      while (current != null) {
        current.displayLink();
        current = current.next;
      }
      System.out.println("");
    }

    class Link {
      public long data; // data item

      public Link next; // next link in list

      public Link(long d) {
        data = d;
      }

      public void displayLink() {
        System.out.print(data + " ");
      }
    }

  }
}
           
       
Related examples in the same category
1. Demonstration of Stack ClassDemonstration of Stack Class
2. Stack in java.utilStack in java.util
3. Stack data structureStack data structure
4. Bracket Checker
5. String Reverser Through Stack String Reverser Through Stack
6. Triangular numbersTriangular numbers
7. Triangular numbers with stack replaces recursionTriangular numbers with stack replaces recursion
w___ww___._j___a___v_a__2s___.c_o__m___ | Contact Us
Copyright 2003 - 08 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.