in which order will a postorder walk of a binary search tree visit the nodes of the tree

a$)$increasing order

b$)$Decreasing order

c$)$First increasing then decreasing

d$)$ None of the above