Hear is given a set of input representing the nodes of a binary tree, write a non recursive algorithm that must be able to give the output in three traversal orders. Write down an algorithm for checking validity of the input, i.e., the program must know if the input given is duplicated, disjoint and has a loop.                                                                                                             

The Pre-order Traversal

The process of doing a pre-order traversal iteratively then has the following steps (assuming that a stack is available to hold pointers to the proper nodes):

1. push NULL onto the stack

2. start at the root and begin execution

3. write the information in the node

4. if the pointer to the right is not NULL push

the pointer onto the stack

5. if the pointer to the left is not NULL move the pointer to the node on the left

6. if the pointer to the left is NULL pop the stack

7. repeat steps 3 to 7 until no nodes remain

Posted Date: 7/9/2012 10:08:36 PM | Location : United States

Ask an Expert

Related Discussions:- Algorithm for pre-order traversal, Assignment Help, Ask Question on Algorithm for pre-order traversal, Get Answer, Expert's Help, Algorithm for pre-order traversal Discussions

Write discussion on Algorithm for pre-order traversal
Your posts are moderated

Write your message here..

Related Questions

Splaying algorithm, Insertion & deletion of target key requires splaying of... Insertion & deletion of target key requires splaying of the tree. In case of insertion, the tree is splayed to find the target. If, target key is found out, then we have a duplicat

Areas of use - sequential files, Sequential files are most frequently utili... Sequential files are most frequently utilized in commercial batch oriented data processing where there is the concept of a master file on which details are inserted periodically. F

CREATING ENSEMBLE NEERAL NETWORK, HOW DO I CREATE ENSEMBLE NETWORK IN MATLA... HOW DO I CREATE ENSEMBLE NETWORK IN MATLAB

How can a lock object be called in the transaction, How can a lock object b... How can a lock object be called in the transaction? By calling Enqueue and Dequeue in the transaction.

Graph, Multilist Representation of graph Multilist Representation of graph

Pseudocodes, how to draw a 5 inch square on the screen using * symbol how to draw a 5 inch square on the screen using * symbol

Entity relationship diagram, This question is based on the requirements of ... This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

Array implementation of a queue, Since the stack is list of elements, the q... Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

Define the carrier set of the symbol abstract data type, Define the Carrier... Define the Carrier set of the Symbol ADT Carrier set of the Symbol ADT is the set of all finite sequences of characters over Unicode characters set (Unicode is a standard char

Order of the worst case of quick sort, The worst case of quick sort has ord... The worst case of quick sort has order O(n 2 )