TREE TRAVERSAL
+========+
Time: 1 hour - 2 hours
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement functions to perform pre-order, in-order, and post-order traversal of the tree and return a list of the visited nodes.
+========+
Please answer to this message with your solution :)
>>Click here to continue<<