/ Visualizers / 2-3 trees
(версия для печати)
© N.N. Krasilnikov
Saint-Petersburg State University of Information Technologies, Mechanics and Optics
On Computer technologies faculty Saint-Petersburg State University ITMO for development and realizations of visualizers of algorithms on the basis of final automats Vizi-technology has been offered.
Visualizer - the program that demonstrates work of algorithm for the chosen data set.
2-3 tree - a tree for which expected running time for operations of search, insert and removal is O(log n), n - number of elements in 2-3 tree.
In this work the visualizer of algorithms of search, insert and removal for 2-3 trees is constructing on the basis of Vizi-technology.