The articlal is touch the problem of impossibility to give certain assessment of compliting of data search operation while using classic binary search trees. Proposed an solution to solve that problem by using AVL-trees. Given algoritms od operations applied to AVL-trees.
Keywords: AVL-tree, binary search tree, tree balancing, data searching by known key