We have seen in class the iterative version of the pre-order traversal. The following two links that discuss how post-order and in-order traversals can be implemented iteratively:
http://leetcode.com/2010/04/binary-search-tree-in-order-traversal.html
http://leetcode.com/2010/10/binary-tree-post-order-traversal.html
http://leetcode.com/2010/04/binary-search-tree-in-order-traversal.html
http://leetcode.com/2010/10/binary-tree-post-order-traversal.html
No comments:
Post a Comment