CareerCup

public void inorder(Tree node){
if(node.left!=null)
inorder(node.left)
system.out.println(node.data);
if(node.right!=null)
inorder(node.right);

}

inorder(ptr)
struct node *ptr { if(ptr!=NULL){
inorder(ptr->lchild)
printf("%c",ptr->data)
inorder(ptr->rchild)}}

Both above codes are of preorder traveral.
left subtree -> Node -> righ subtree

For Inorder traversal, the order is
Node -> left subtree -> righ subtree

This one should work. Please comment.

public void inorder(Tree node)
{
	if(node == null) return;
	system.out.println(node.data);
	inorder(node.left);
	inorder(node.right);
}