AVL and Red-Black tree as a single balanced tree

DJAMEL EDDINE, ZEGOUR and LYNDA, BOUNIF (2016) AVL and Red-Black tree as a single balanced tree. In: Fourth International Conference on Advances in Computing, Communication and Information Technology CCIT- 2016, 17 - 18 March, 2016, Birmingham City University, Birmingham, UNITED KINGDOM.

[img]
Preview
Text
20160414_055747.pdf - Published Version

Download (671kB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/7...

Abstract

Since the invention of AVL trees in 1962 and Red-black trees in 1978, researchers were divided in two separated communities, AVL supporters and Red-Black ones. Indeed, AVL trees are commonly used for retrieval applications whereas Red Black trees are used in updates operations, so, the choice of a structure must be done firstly even if the operations are not known to be searches or updates. That is the main reason why we propose a common tree with the same complexity and memory space, representing both an AVL and a Red-Black tree, this new tree allows to gather together the two communities on one hand, and to expand the scope of AVL and Red-Black tree applications on the other hand.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Balanced trees, AVL, Red-Black, Partitioning.
Depositing User: Mr. John Steve
Date Deposited: 25 Mar 2019 12:12
Last Modified: 25 Mar 2019 12:12
URI: http://publications.theired.org/id/eprint/907

Actions (login required)

View Item View Item