Book contents
- Frontmatter
- Contents
- Preface
- 1 Introduction to recursion
- 2 Recursion with linked-linear lists
- 3 Recursion with binary trees
- 4 Binary recursion without trees
- 5 Double recursion, mutual recursion, recursive calls
- 6 Recursion with n-ary trees and graphs
- 7 Simulating nested loops
- 8 The elimination of recursion
- Further reading and references
- Index of procedures
3 - Recursion with binary trees
Published online by Cambridge University Press: 05 February 2012
Book contents
- Frontmatter
- Contents
- Preface
- 1 Introduction to recursion
- 2 Recursion with linked-linear lists
- 3 Recursion with binary trees
- 4 Binary recursion without trees
- 5 Double recursion, mutual recursion, recursive calls
- 6 Recursion with n-ary trees and graphs
- 7 Simulating nested loops
- 8 The elimination of recursion
- Further reading and references
- Index of procedures
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Recursion via Pascal , pp. 45 - 68Publisher: Cambridge University PressPrint publication year: 1984