BINARY TREE TRAVERSAL
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement a function that performs a preorder, in-order and post-order traversal of the tree.
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<