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
AVL trees are applied into the given situations: There are few insertion & deletion operations Short search time is required Input data is sorted or nearly sorted

Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.

HLS Colour Model  This model has the double-cone representation shown in Figure 3.40. The three colour parameters in this model are called hue (H), lightness (L), and Saturati

Ordinary variable An ordinary variable of a easy data type can store a one element only

Explain the Abstract data type assertions Generally, ADT assertions translate into assertions about the data types which implement ADTs, which helps insure that our ADT impleme

how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?

A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"

B Tree Unlike a binary-tree, every node of a B-tree may have a variable number of keys and children. The keys are stored in non-decreasing order. Every key has an associated ch

Q. Which sorting algorithm can be easily adaptable for singly linked lists? Explain your answer as well.        Ans: The simple Insertion sort is sim

Give example of assertion and abstract data type For illustration, consider Natural ADT whose carrier set is the set of non-negative integers and whose operations are the usual