AVL-tree generator in Pascal. Tested with Turbo Pascal 3.0.

Creates an AVL-tree for dynamic storage of data. Insert, delete, find, find min and find max procedures are implemented. ReadMe file is in Czech, source code contains comments in English for clarity.

This is a semestral project for course NPRG030 @ the Faculty of Mathematics and Physics, Charles University, Prague.

(c) David Novak, 2018