Design a conventional iterative algorithm to traverse a binary tree represented in linked lists in postorder.

trivial

 Profile Answers by trivial Questions by trivial

• Aug 19th, 2009

We define int visit[SIZEOFTREE] such that visit[i]=1 if i th node is visited=0 otherwise visit[NULL]=1 alwaysvoid posttrav_ite...

Answer Question  Select Best Answer