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
* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)

Explain Optimal Binary Search Trees One of the principal application of Binary Search Tree is to execute the operation of searching. If probabilities of searching for elements

Q. Explain the complexity of an algorithm?  What are the worst case analysis and best case analysis explain with an example.

The number of leaf nodes in a complete binary tree of depth d is    2 d

implementation of fast fourier transforms for non power of 2

Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

Question a) Describe how the endogenous model is an improvement to the neo-classical model in explaining the long-run effect of investment on economic growth of a country.

Q. Using array to execute the queue structure, write down an algorithm/program to (i) Insert an element in the queue. (ii) Delete an element from the queue.

implement multiple stacks ina single dimensional array. write algorithams for various stack operation for them.

for(int i = 0; i for (int j = n - 1; j >= i ; j--){ System.out.println(i+ " " + j);