def level_traversal(self, root):
q = Queue()
visited = []
q.enqueue(root)
while not q.is_empty():
node = q.dequeue()
visited.append(node.value)
if node.left:
q.enqueue(node.left)
if node.right:
q.enqueue(node.right)
return visited
def test_dequeue():
q = Queue(3)
for val in range(1, 4):
q.enqueue(val)
index_head = index_tail = -1
assert q.is_full()
assert q.dequeue()
assert q.dequeue()
assert q.dequeue()
assert q.is_empty()
assert q.head == index_head
assert q.tail == index_tail
def test_enqueue():
q = Queue(3)
index_head = 0
index_tail = 2
assert q.enqueue(1)
assert q.enqueue(2)
assert q.enqueue(3)
assert not q.enqueue(4)
assert not q.is_empty()
assert q.is_full()
assert q.head == index_head
assert q.tail == index_tail
def __init__(self, screen):
pygame.mixer.init()
self.pixel_font = pygame.font.Font("font/karma future.ttf", 23)
self.pixel_skip_font = pygame.font.Font("font/Beef'd.ttf", 17)
self.mode = "cinematique"
self.player = Player(1, [
pygame.K_UP, pygame.K_RIGHT, pygame.K_LEFT, pygame.K_DOWN,
pygame.K_p, pygame.K_m, pygame.K_x
], [30, 200], self, (5, 216, 255))
self.all_players = pygame.sprite.Group(self.player)
self.all_ennemies = pygame.sprite.Group()
self.switch_event = pygame.USEREVENT + 10
self.font = pygame.font.SysFont('impact', 25, bold=False)
self.font2 = pygame.font.SysFont('arial', 24, bold=False)
self.surfaces = {}
self.chooser = Chooser(self)
self.is_switch = True
self.stat = "in game"
self.dico = {1: "green", 2: "blue"}
self.is_played_sound = True
self.is_affiched = False
self.liste = [
"salut je suis akito",
"j'espère que vous vous amuseriez avec mon jeu",
"après il n'est pas terminé", "et ce n'est qu'un prototype",
"mais je veux que vous le testeriez quand même",
"et soyez détériminé", "c'est la seule chose que je peux vous dire"
]
self.queue = Queue(self.liste,
60,
screen,
font=self.pixel_font,
skip_font=self.pixel_skip_font)
self.music_started = False
self.color_lost = (255, 255, 255)
self.lost = self.pixel_skip_font.render("tu as perdu", False,
self.color_lost)
self.lost_rect = self.lost.get_rect()
self.lost_rect.x, self.lost_rect.y = (720 - self.lost.get_width() - 30,
0 + self.lost.get_height() + 120)
self.secret_mode = False
self.color_return = (255, 255, 255)
self._return = self.pixel_skip_font.render("return", False,
self.color_return)
self._return_rect = self._return.get_rect()
self._return_rect.x, self._return_rect.y = (screen.get_width() - 50 -
self._return.get_width(),
screen.get_height() - 50 -
self._return.get_height())
self.score = 0
from termcolor import colored
from queue_ import Queue
from linear import Array
from stack import Stack
from bubble import BubbleSort
from linked_list import LinkedList
from binary_search import BinarySearch
from bubble import BubbleSort
from selection import SelectionSort
from binary_tree import BinaryTree
# all objects of the classes
larr = Array()
stk = Stack(10)
quez = Queue()
llist = LinkedList()
binary = BinarySearch()
bubble = BubbleSort()
selection = SelectionSort()
bitree = BinaryTree()
def main_menu():
print("\v")
text = colored(' ALGORITHMS AND DATA STRUCTURES ','magenta','on_cyan',['blink'])
print("\t\t\t\t",text)
print("\v")
AL = {
1:"Array",2:"stacks",3:"Queue",4:"Linked list",5:"Binary trees",
6:"binary Search",7:"BubbleSort",8:"insertion sort",9:"selection sort"}
from queue_ import Element, LinkedList, Queue
el1 = Element("Apple")
el2 = Element("Pear")
el3 = Element("Peach")
q = Queue()
q.enqueue(el1)
q.enqueue(el2)
print(q.ll.toArray())
q.dequeue()
q.dequeue()
q.dequeue()
print(q.ll.toArray())
q.enqueue(el1)
q.enqueue(el2)
q.enqueue(el3)
print(q.ll.toArray())
def reset_queue(self, screen):
self.queue = Queue(self.liste,
60,
screen,
font=self.pixel_font,
skip_font=self.pixel_skip_font)
def test_work():
q = Queue(3)
assert q.enqueue(7)
assert q.dequeue()
assert q.front() == -1
assert not q.dequeue()
assert q.front() == -1
assert q.rear() == -1
assert q.enqueue(0)
assert not q.is_full()
assert q.dequeue()
assert q.enqueue(3)
assert q.enqueue(4)
assert q.enqueue(5)
assert q.is_full()
assert q.front() == 3
assert q.rear() == 5
def test_enqueue_dequeue():
q = Queue(3)
for val in range(1, 4):
q.enqueue(val)
assert q.front() == 1
assert q.rear() == 3
assert q.dequeue()
assert q.front() == 2
assert q.rear() == 3
assert q.dequeue()
assert q.front() == 3
assert q.enqueue(10)
assert q.rear() == 10
def test_create_queue():
q = Queue(5)
assert q.is_empty()
assert not q.is_full()