Nick Keighley wrote:
On 19 Apr, 07:40, nishit.gu...@st.com wrote:
Can somebody please help me for algorithm for postorder bst traversal
without recursion.
It should use stack. i am not able to implement it.
from wiki:
postorder(node)
if node.left â‰* null then postorder(node.left)
if node.right â‰* null then postorder(node.right)
print node.value
this took me about 10s to find
--
Nick Keighley
Thanks for your efforts ;-) but u used recursion
****************************************
with recursion, for preorder :
-------------------------
preorder(node){
if(node){
print info(node)
preorder(node->left)
preorder(node->right)
}
with recursion, for postorder :
-------------------------
postorder(node){
if(node){
postorder(node->left)
postorder(node->right)
print(info(node))
with recursion, for postorder :
-------------------------
inorder(node){
if(node){
inorder(node->left)
inorder(info(node))
inorder(node->right)
}
**********************************
i hope it clrifies the intent...
i need the same output without any recursive call
it must be same as i have done above for inorder,
preorder just needs a little modification
for postorder one needs to store some info about left/rigth child
but i am not sure what???