in this traversal methodthe root node is visited lasthence the name first we traverse the left subtreethen the right subtree and finally the root node we start from aand following post-order traversalwe first visit the left subtree is also traversed post-order the process goes on until all the nodes are visited the output of post-order traversal of this tree will be - - - - - - algorithm until all nodes are traversed step recursively traverse left subtree step recursively traverse right subtree step visit root node