Which among the following is the pseudo code for post-order traversal?
Order(node): if node is not null: Order(node.left) Order(node.right) print node.value
Order(node): if node is not null: Order(node.right) Order(node.left) print node.value
Order(node): if node is not null: Order(node.left) print node.value
None of the above
This question is part of this quiz :
Quiz On Tree Data Structure