| Abstract | U programima i u svakodnevnom životu često imamo podatke koje trebamo organizirati. Prilikom programiranja to činimo korištenjem apstraktnih tipova podataka. U prvom poglavlju definiramo pojmove strukture podataka, apstraktnog tipa podataka i algoritma. U drugom poglavlju definiramo i implementiramo listu, vezanu listu, stog, red i dvostrani red te komentiramo složenosti njihovih metoda. U trećem poglavlju govorimo o stablima, binarnim stablima i binarnim stablima traženja. U četvrtom poglavlju upoznat ćemo i implementirati apstraktni tip podataka prioritetni red, koji je sličan linearnim strukturama iz drugog poglavlja. U zadnjem, petom poglavlju, definiramo neuređene strukture podataka: skup, rječnik, preslikavanje i binarne relacije. |
| Abstract (english) | In computer programs and everyday life, we have data that we need to organize. While programming, we do that by using abstract data types. In the first chapter, we define data structures, abstract data types, and algorithms. In the second chapter, we define and implement a list, linked list, stack, queue, and deque and comment on the complexity of their methods. In the third chapter, we talk about trees, binary trees, and binary search trees. In the fourth chapter, we get to know and implement the abstract data type priority queue, which is similar to the linear structures from the second chapter. In the last, fifth chapter, we define the unordered data structures: set, dictionary, mapping, and relation. |
