Purpose: presentation of the theory about AVL Tree, that is used as the one of the fastest data structures for searching and sorting the large records. Also, my own implementation of the code of this algorithm, with demo data input, that demonstrates insertion and deletion of nodes. The code has many comments, which make it easier to understand how the algorithm works. Design/methodology/approach: study of the literature to create the implementation of AVL BST Tree data structure and algorithms for insertion, deletion, sorting, using Java 8 programming language. Findings: an algorithm was developed for inserting, deleting, sorting, outputting to the console a balanced AVL tree. The code is in github repository and it is open-source. Research limitations/implications: Participation in different seminars and workshops, with topics in the Computer Science: Algorithms. Practical implications: AVL Tree is used in databases as the one of the fastest data structures for searching and sorting the large records, but not recommended in cases where insertions and deletions are frequent. Originality/value: this project contains all important functions such as BTreePrinter.printNode for prettifying any binary tree in the console, leftRotation, rightRotation, insertion, deleteNode. The code has a lot of important comments in Russian, with demonstrations how it works. Also, I made a great training presentation about the theory of AVL.