inorder traversal of binary tree

Given a binary tree,print its inorder traversal without using recursion and stack.

Comments

  1. it can be done using threaded tree taking extra pointer rthread pointing to the inorder successor of each node...

    ReplyDelete
  2. @kamakshi can you please elaborate your approach...:)

    ReplyDelete

Post a Comment

Popular posts from this blog