Write algorithm for post-order traversal, Data Structure & Algorithms

Post-order Traversal : This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-order traversal algorithm.

Refer: http://www.expertsmind.com/questions/in-order-traversal-3016324.aspx

http://www.expertsmind.com/questions/algorithm-for-pre-order-traversal-3016323.aspx

Posted Date: 7/9/2012 10:11:58 PM | Location : United States







Related Discussions:- Write algorithm for post-order traversal, Assignment Help, Ask Question on Write algorithm for post-order traversal, Get Answer, Expert's Help, Write algorithm for post-order traversal Discussions

Write discussion on Write algorithm for post-order traversal
Your posts are moderated
Related Questions
Example: (Double left rotation while a new node is added into the AVL tree (RL rotation)) Figure: Double left rotation when a new node is inserted into the AVL tree A

I need help writing a pseudocode for my assignment can anyone help?

Preconditions assertion A precondition is an assertion which should be true at the initiation of an operation. For instance, a square root operation can't accept a negative a

creation,insertion,deletion of header linked list using c.

Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

human resource management project work in c++


Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

differences between direct and indirect recursion

Q. Reverse the order of the elements on a stack S    (i) by using two additional stacks (ii) by using one additional queue. Ans :      L e t S be the stac