Thread: pls help me urgent..

Check out the tutorials section on this website...

pls help me i am in urgent need i have to prepare for my exam and i don't know how to code

:=mind the "urgent" && exam =:
Although im not a sinical or sarcastic person i love to see this phrase on this board.

all the ways to traverse a tree basically have 3 statements:

struct node { int data, node *left, node *right };

output self | cout << node->data;
recurse to left | output_function(node->left);
recurse to right | output_function(node->right);

the 3 ways are basically different orders (left always comes before right)

pre = output self first (self,left,right)
in = output self between (left,self,right)
post = output self last (left,right,self)

Pay attention in class from now on.. and good luck

Edit: Ignore inorder, I noticed you didnt ask for it so you probably dont need that one.