Abstract
In the preceding chapter we considered several problems that required us to enumerate all elements of some set X. The solution used the following scheme: A linear ordering on X was imposed and a procedure to generate the next element of X (according to that order) was described.
Sometimes this scheme cannot be applied directly. In this chapter, we consider another useful approach that allows us to generate all elements of some set. It is called “backtracking” or “tree traversal”.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Shen, A. (2010). Tree traversal (backtracking). In: Algorithms and Programming. Springer Undergraduate Texts in Mathematics and Technology. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-1748-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1748-5_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1747-8
Online ISBN: 978-1-4419-1748-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)