1. Knuth, D.E.: The Art of Computer Programming, vol. 4. Generating All Trees, History of Combinatorial Generation. Addison-Wesley (2006)
2. Lapey, P., Williams, A.: Pop & push: ordered tree iteration in O(1)-time. In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, Seoul, Korea, 19–21 December 2022. LIPIcs, vol. 248, pp. 53:1–53:16 (2022)
3. Lucas, J.M.: The rotation graph of binary trees is Hamiltonian. J. Algorithms 8(4), 503–535 (1987)
4. Lucas, J.M., van Baronaigien, D.R., Ruskey, F.: On rotations and the generation of binary trees. J. Algorithms 15(3), 343–366 (1993)
5. Mütze, T.: Combinatorial Gray codes - an updated survey. CoRR, abs/2202.01280 (2022)