Árboles Biselados
DOI:
https://doi.org/10.15381/risi.v6i1.3330Keywords:
Search tree, splay tree, amortized analysis.Abstract
The objective of this study is to assess the complexity order of search operations, insertion and/or elimination in a beveled tree. For the deployment of a node the very utilized rotation technique is used in the trees AVL. For the evaluation of the complexity of operations the amortized method of analysis is used. The amortized analysis in beveled trees is beneficial insofar as is applied when a succession of m operations is realized for so that overall the time of the operation ought to be no more of O (m Log n), although individually every operation can be of order O(n).Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2009 Augusto Cortez Vásquez, Hugo Vega huerta
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the Revista de investigación de Sistemas e Informática.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating its initial publication in the Revista de investigación de Sistemas e Informática (the originator of the work, journal, volume, number and date).
