algo_048.md (293B)
1 # algo_048 2 3 ### Problem Statement 4 5 > Write a recursive algorithm for postorder traversal of a binary tree. 6 7 ## Algorithm 8 ``` 9 procedure postorder(ptr) 10 begin 11 if (ptr ≠ NULL) then 12 postorder(LC(ptr)); 13 postorder(RC(ptr)); 14 write(INFO(ptr)); 15 endif 16 end procedure 17 ```