python-data-structures/stack.py at linear-data-structures · Jamalludeen/python-data-structures · GitHub

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
class Stack:
    def __init__(self, size):
        self.size = size
        self.stack = []

    def push(self, value):
        if len(self.stack) < self.size:
            self.stack.append(value)
        else:
            print("Stack is full!")

    def pop(self):
        if len(self.stack) >= 1:
            data = self.stack[-1]
            del self.stack[-1]
            return f'{data} poped'

        else:
            return "Stack is empty!"

    def peek(self):
        try:
            return self.stack[-1]
        except:
            return "Stack is empty!"

    def get_items(self):
        return f'stack -> {self.stack}'


    def traverse(self):
        if len(self.stack):
            for i in self.stack:
                print(i)
        else:
            print("Stack is empty!")


    def traverse(self):
        if len(self.stack):
            for i in self.stack:
                print(i)
        else:
            print("Stack is empty!")

    def update(self, index, value):
        if index <= (len(self.stack)-1):
            self.stack[index] = value

    def is_empty(self):
        return len(self.stack) == 0

    def is_full(self):
        return len(self.stack) == self.size

    def size(self):
        return len(self.stack)