 |  |  |  |  |  |  |  |
recursive algorithm
Please support our C++ advertiser: Intel Parallel Studio Home
 |
hi, can someone help me with writing down a recursive algorithm for traversing a binary tree in reverse-postorder that also returns the rank of each node? So far i have (and i know thatit isnt much but this problem giving me issues).
i hope that someone can give me some serious help thanks in advance
C++ Syntax (Toggle Plain Text)
i hope that someone can give me some serious help thanks in advance
•
•
Join Date: Aug 2006
Posts: 223
Reputation: 
Solved Threads: 10
Posting Whiz in Training
What language is this, Basic? This is the C/C++ forum, please ask your question in the forum for the appropiate lanuage.
no its just an algorithm for the problem. Im suppose to be writing it in C or C++ but i decided to write the algorithm first. But im having problems with it.So any one who can help me solve this problem i would greatly appreciate it.
•
•
Join Date: Jun 2006
Posts: 7,623
Reputation: 
Solved Threads: 468
What do you exactly mean by reverse postorder? In postorder the value is accessed after accessign all the left and the right children or branches.
So if you want reverse then it must mean preorder traversal.
[quote]
Preorder:
1. Print out the value and save the node or value to stack.
2. If left child not null call Preorder (left)
3. If right child not null call Preorder (right).
If this is not your problem stmt then restate it with examples.
Best of luck,
So if you want reverse then it must mean preorder traversal.
[quote]
Preorder:
1. Print out the value and save the node or value to stack.
2. If left child not null call Preorder (left)
3. If right child not null call Preorder (right).
If this is not your problem stmt then restate it with examples.
Best of luck,
I don't accept change; I don't deserve to live.
•
•
Join Date: Aug 2005
Posts: 5,266
Reputation:
Solved Threads: 377
•
•
•
•
Originally Posted by ~s.o.s~ 
So if you want reverse then it must mean preorder traversal.
Last edited by iamthwee; Sep 28th, 2006 at 2:45 pm.
*Voted best profile in the world*
•
•
Join Date: Jun 2006
Posts: 7,623
Reputation:
Solved Threads: 468
•
•
•
•
Originally Posted by iamthwee
It seems odd that he would state preorder as being reverse post order. Why not just as for a preorder traversal algo. But than nothing surprises me these days so you could be right?
I don't accept change; I don't deserve to live.
|
Similar Threads
- MIPS Recursive Programming, Help please! (Assembly)
- algorithm problem with recursion (Java)
- recursive findaverage function for Binary search tree (C)
- binary trees (C)
- Can you guys help me? about Quick Sort Algorithm (C)
- recursive algorithm (C)
Other Threads in the C++ Forum
- Previous Thread: Arrays?
- Next Thread: GetFile Help.
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Latest C++ Posts
- Today's Posts
- Unanswered Threads
Related Forum Features
api array arrays based beginner binary c++ c/c++ calculator char char* class classes code compile compiler console conversion count delete deploy desktop directshow dll download dynamic dynamiccharacterarray encryption error file forms fstream function functions game givemetehcodez google graph gui homeworkhelp homeworkhelper iamthwee ifstream input int integer java lib linkedlist linker linux list loop looping loops map math matrix memory news number numbertoword output parameter pointer problem program programming project python random read recursion recursive reference return rpg sorting string strings struct temperature template templates test text text-file tree unix url variable vector video visual visualstudio win32 windows winsock wordfrequency wxwidgets
