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

Ask an Expert

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

Write your message here..

Related Questions

Threaded Binary Tree, If a node in a binary tree is not containing left or ... If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

Aa-trees, Red-Black trees have introduced a new property in the binary sear... Red-Black trees have introduced a new property in the binary search tree that means an extra property of color (red, black). However, as these trees grow, in their operations such

Algorithm for multiplication of two sparse matrices using li, algorithm for... algorithm for multiplication of two sparse matrices using linked lists..

Determine the critical path and the expected completion, The information in... The information in the table below is available for a large fund-raising project. a. Determine the critical path and the expected completion time of the project. b. Plot the total

Write procedure to the insert a node into the linked list, Q. Write a proce... Q. Write a procedure to the insert a node into the linked list at a particular position and draw the same by taking an example?

Operation of algorithm, Operation of Algorithm The following sequence o... Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou

Representation of arrays?, A representation of an array structure is a mapp... A representation of an array structure is a mapping of the (abstract) array with elements of type T onto the store which is an array with elements of type BYTE. The array could be

Breadth-first search , 1. Apply the variant Breadth-First Search algorithm ... 1. Apply the variant Breadth-First Search algorithm as shown in Figure 2 to the attached graph. This variant is used for computing the shortest distance to each vertex from the sta

Infix expression into the postfix expression, Q. Write down an algorithm to... Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

Stack, infix to revrse polish infix to revrse polish