FilesExpand file tree

 master

/

StackOfLinkedList.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

112 lines (90 loc) · 2.28 KB

 master

/

StackOfLinkedList.java

Top

File metadata and controls

• Code
• Blame

112 lines (90 loc) · 2.28 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

package DataStructures.Stacks;

/**

* @author Varun Upadhyay (https://github.com/varunu28)

*/

// An implementation of a Stack using a Linked List

class StackOfLinkedList {

public static void main(String[] args) {

LinkedListStack stack = new LinkedListStack();

stack.push(1);

stack.push(2);

stack.push(3);

stack.push(4);

stack.push(5);

stack.printStack();

System.out.println("Size of stack currently is: " + stack.getSize());

stack.pop();

stack.pop();

System.out.println("Top element of stack currently is: " + stack.peek());

}

}

// A node class

class Node {

public int data;

public Node next;

public Node(int data) {

this.data = data;

this.next = null;

}

}

/**

* A class which implements a stack using a linked list

* <p>

* Contains all the stack methods : push, pop, printStack, isEmpty

**/

class LinkedListStack {

Node head = null;

public void push(int x) {

Node n = new Node(x);

if (head == null) {

head = n;

} else {

Node temp = head;

n.next = temp;

head = n;

}

}

public void pop() {

if (head == null) {

System.out.println("Empty stack. Nothing to pop");

}

Node temp = head;

head = head.next;

System.out.println("Popped element is: " + temp.data);

}

public int peek() {

if (head == null) {

return -1;

}

return head.data;

}

public void printStack() {

Node temp = head;

System.out.println("Stack is printed as below: ");

while (temp != null) {

if (temp.next == null) {

System.out.print(temp.data);

} else {

System.out.print(temp.data + " -> ");

}

temp = temp.next;

}

System.out.println();

}

public boolean isEmpty() {

return head == null;

}

public int getSize() {

if (head == null)

return 0;

else {

int size = 1;

Node temp = head;

while (temp.next != null) {

temp = temp.next;

size++;

}

return size;

}

}

}