Abstract
Iteration and recursion are strategies to solve complex problems by repeatedly performing simpler operations. But while iteration involves repeating the same operation in a loop, recursion means partially solving increasingly simpler cases of the problem until you reach base cases for which you already have a solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Giulio Zambon
About this chapter
Cite this chapter
Zambon, G. (2016). Iteration, Recursion, and Binary Trees. In: Practical C. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-1769-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4842-1769-6_3
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-1768-9
Online ISBN: 978-1-4842-1769-6
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books