π³ 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
