List of top Programming and Data Structures Questions on Binary Trees: Inorder, Preorder, Postorder Traversal asked in GATE CS

The set T represents various traversals over a binary tree. The set S represents the order of visiting nodes during a traversal.
TS
I: InorderL: left subtree, node, right subtree
II: PreorderM: node, left subtree, right subtree
III: PostorderN: left subtree, right subtree, node
Which one of the following is the correct match from T to S?