๐ณ Recursive tree traversal in Python visually explained:
memory-graph.com#codeurl=http...
A binary tree can be traversed in three classic ways:
๐น ๐ฃ๐ฟ๐ฒ๐ผ๐ฟ๐ฑ๐ฒ๐ฟ: current, left, right
๐น ๐๐ป๐ผ๐ฟ๐ฑ๐ฒ๐ฟ: left, current, right
๐น ๐ฃ๐ผ๐๐๐ผ๐ฟ๐ฑ๐ฒ๐ฟ: left, right, current
