data_structures/run.py at master · hyoungsookim/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
from data_structure import Stack, LinkedList


if __name__ == '__main__':
    print('----------------------------------------')
    print('Stack')
    print('----------------------------------------')

    stack = Stack()

    print('is empty:' + str(stack.is_empty))
    print('stack size:' + str(stack.size))

    stack.push('a')
    stack.push('b')
    stack.push('c')

    print('stack pushed a, b, c')

    print('is empty:' + str(stack.is_empty))
    print('stack size:' + str(stack.size))

    print('Pop:', stack.pop())
    print('Pop:', stack.pop())
    print('Pop:', stack.pop())

    print('is empty:' + str(stack.is_empty))
    print('stack size:' + str(stack.size))

    print()
    print('----------------------------------------')
    print('Linked List')
    print('----------------------------------------')

    linked_list = LinkedList()

    print('size:' + str(linked_list.size))

    linked_list.insert(10)
    linked_list.insert(20)
    linked_list.insert(30)

    print('size:' + str(linked_list.size))

    print(str(linked_list.search(30).get()))
    print(str(linked_list.search(30).get_next_node().get()))

    linked_list.delete(20)

    print('deleted: 20')
    print('size:' + str(linked_list.size))

    linked_list.insert('A')

    print('inserted: "A"')
    print('size:' + str(linked_list.size))