Difficulty: Easy; Category: Tree — There are three types of DFS traversal:
> Preorder: Root, Left, Right
> Inorder: Left, Root, Right
> Postorder: Left, Right, Root As long as you can remember how the position of the root is placed related to these three order, you can easily solve the problems below. LeetCode 94 — Binary Tree Inorder Traversal Inorder traversal…