Skip to main content
Conference ProceedingsOPEN ACCESS

Optimal-area upward drawings of AVL trees: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 894 307-317
DOI: 10.1007/3-540-58950-3_386
12Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We prove that any AVL tree admits a linear-area planar straight-line grid strictly-upward drawing, that is, a drawing in which (a) no two edges intersect, (b) each edge is mapped into a single straight-line segment, (c) each node is mapped into a point with integer coordinates, and (d) each node is placed below its parent.

Cite

CITATION STYLE

APA

Crescenzi, P., & Piperno, A. (1995). Optimal-area upward drawings of AVL trees: Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 307–317). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_386

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free