Предикатная программа вставки в АВЛ-дерево

Predicate program of insertion into AVL-tree

Article's language
Russian
Abstract
The AVL-tree operators are usually presented in functional languages in compact and elegant stile. However functional programs for insertion and removal operators are ineffective. They implement the construction of new tree but not the modification of the source tree. The paper describes the predicate programs for two algorithms of insertions into an AVL-tree. The predicate program can be automatically transformed to effective imperative programs.
DOI
10.31144/si.2307-6410.2017.n9.p23-42
Pages
23-42
File
avl_insert1.pdf472.38 KB
Number