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
Q. What do you understand by the term by hash clash? Explain in detail any one method to resolve the hash collisions.

The two famous methods for traversing are:- a) Depth first traversal b) Breadth first

1.  Using the traditional method of CPM: a.  What activities are on the critical path? b.  What is the expected total lead time of the project? 2.  Using CCPM: a.  What

If a node in a BST has two children, then its inorder predecessor has No right child

Implementations of Kruskal's algorithm for Minimum Spanning Tree. You are implementing Kruskal's algorithm here. Please implement the array-based Union-Find data structure.

write an algorithm for multiplication of two sparse matrices using Linked Lists

how we will make projects on stack in c?

The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

Encryption the plain-text using the round keys: 1. (Key schedule) Implement an algorithm that will take a 128 bit key and generate the round keys for the AES encryption/decryp