Postorder Traversal of a Binary Tree

Multiple Choice

Postorder traversal of a binary tree

A) first visits the root,then recursively traverses the left and right subtree
B) recursively traverses the left subtree,then visits the root,then traverses the right subtree
C) recursively traverses the left subtree,then traverses the right subtree,then visits the root
D) visits all the nodes according to their natural order