article

Free access

Teaching of tree data structures using microcomputer graphics

Author:

G. Scott OwenAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 18, Issue 1

Pages 67 - 72

https://doi.org/10.1145/953055.5634

Published: 01 February 1986 Publication History

PDF eReader

Abstract

A set of procedures to graphically display ordered and unordered trees has been developed. The procedures have been used in several class demonstration programs to illustrate tree insertion, deletion, and balancing algorithms. The procedures are available for inclusion in student programs so that they can determine if their programs are working correctly. The procedures are written in Turbo Pascal for an IBM PC.

References

[1]

M.H.Brown and R. Sedgewick, "Techniques for Algorithm Animation", IEEE Software, Vol. 2, No. I, p. ~8, (January, 1985 ).

Digital Library

Google Scholar

[2]

R.L. Kruse, "Data Structures & Program Design", Prentice Hall, 1984.

Digital Library

Google Scholar

Cited By

View all

Augenstein MLangsam Y(1988)Automatic generation of graphic displays of data structures through a preprocessorACM SIGCSE Bulletin10.1145/52965.5300120:1(148-149)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52965.53001
Augenstein MLangsam Y(1988)Automatic generation of graphic displays of data structures through a preprocessorProceedings of the nineteenth SIGCSE technical symposium on Computer science education10.1145/52964.53001(148-149)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52964.53001
Maxim BElenbogen B(1987)Teaching programming algorithms aided by computer graphicsProceedings of the eighteenth SIGCSE technical symposium on Computer science education10.1145/31820.31775(297-301)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31820.31775
Show More Cited By

Recommendations

Teaching of tree data structures using microcomputer graphics
SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education

A set of procedures to graphically display ordered and unordered trees has been developed. The procedures have been used in several class demonstration programs to illustrate tree insertion, deletion, and balancing algorithms. The procedures are ...
Traversing binary tree structures with shift register memories (Recent Results)

The paper proposes a tree-structured shift register memory in which traversals of binary data tress in pre-or end-order are performed as sequences of two non-cyclic data permutations which move the data tree relative to a unique access port that is ...
Recursive proofs for inductive tree data-structures
POPL '12: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We develop logical mechanisms and procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are sound, incomplete, but terminating. Our contribution rests in a new extension of first-...

Reviews

Reviewer: Tsang C. Huang

A set of graphical procedures was developed by the author for teaching tree structure insertion, deletion, and balancing. The demonstration procedures allow the author to use two monitors, one for procedure text, and the other for graphics to show students before and after figures of node deletion, insertion, and tree balancing. Students may also use these procedures to visualize a created tree, and other tree structure processes. Thus, the students can verify their program correctness, and become familiar with tree operations easily. Level number computation during node insertion and deletion was not clearly stated. There are two relevant references concerning the subject matter. Complete tree programs using these procedures are available from the author.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 18, Issue 1

Proceedings of the 17th SIGCSE symposium on Computer science education

February 1986

304 pages

ISSN:0097-8418

DOI:10.1145/953055

Issue’s Table of Contents

SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
February 1986
336 pages
ISBN:0897911784
DOI:10.1145/5600
Editors:
Joyce Currie Little
Towson State Univ., Baltimore, MD
,
Lillian N. Cassel
Univ. of Delaware, Newark

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1986

Published in SIGCSE Volume 18, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
325
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)14

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Augenstein MLangsam Y(1988)Automatic generation of graphic displays of data structures through a preprocessorACM SIGCSE Bulletin10.1145/52965.5300120:1(148-149)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52965.53001
Augenstein MLangsam Y(1988)Automatic generation of graphic displays of data structures through a preprocessorProceedings of the nineteenth SIGCSE technical symposium on Computer science education10.1145/52964.53001(148-149)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52964.53001
Maxim BElenbogen B(1987)Teaching programming algorithms aided by computer graphicsProceedings of the eighteenth SIGCSE technical symposium on Computer science education10.1145/31820.31775(297-301)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31820.31775
Barnes GKind G(1987)Visual simulations of data structures during lectureProceedings of the eighteenth SIGCSE technical symposium on Computer science education10.1145/31820.31772(267-276)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31820.31772
Maxim BElenbogen B(1987)Teaching programming algorithms aided by computer graphicsACM SIGCSE Bulletin10.1145/31726.3177519:1(297-301)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31726.31775
Barnes GKind G(1987)Visual simulations of data structures during lectureACM SIGCSE Bulletin10.1145/31726.3177219:1(267-276)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31726.31772

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations