hi, can someone help me with writing down a recursive algorithm for traversing a binary tree in reverse-postorder that also returns the rank of each node? So far i have (and i know thatit isnt much but this problem giving me issues).

```
postorder:
save current posistion
if(lchild)
move to lchild
postorder
if(sibling)
move to sibling
postorder
endif
endif
restore saved position
visit//do something with the node
```

i hope that someone can give me some serious help thanks in advance