[ post-order traversal in this traversal methodthe root node is visited lasthence the name firstwe traverse the left subtreethen the right subtree and finally the root node in the below python programwe use the node class to create place holders for the root node as well as the left and right nodes thenwe create an insert function to add data to the tree finallythe post-order traversal logic is implemented by creating an empty list and adding the left node first followed by the right node at last the root or parent node is added to complete the post-order traversal please note thatthis process is repeated for each sub-tree until all the nodes are traversed class nodedef __init__(selfdata)self left none self right none self data data insert node def insert(selfdata)if self dataif data self dataif self left is noneself left node(dataelseself left insert(dataelif data self dataif self right is noneself right node(dataelseself right insert(dataelseself data data print the tree