CareerCup

What is the question? Please elaborate

public void traverse_vertical(Tree tree)
    {
    	if(tree == null)
    		return;
    	
    	stack.push(tree.element);
    	traverse_vertical(tree.left);
    	while(stack.size()!=0)
    	{
    		System.out.print(stack.pop());
    	}
    	traverse_vertical(tree.right);
    	
    }

reply me if i am wrong

Is the tree structure -

2
/ \
3 4
/ \ / \
5 6 7 8

Do inorder Tree traversal, at each instance push root into stack.
When root becomes null print stack.

tree_traverse(node* root)
{

if(root == null && stack!= empty)
{
print stack
return;
}
s.push(root.value);

tree_traverse(root->left);
tree_traverse(root->right);
}

Here is the function:

void printV(struct node *root,int *arr,int *depth)
{
        if(root)
        {
                arr[++(*depth)]=root->data;
                printV(root->left,arr,depth);
                
                if(!(root->left || root->right))
                {
                        while((*depth)>=0)
                                printf("%d ",arr[(*depth)--]);
                }
                
                printV(root->right,arr,depth);
        }
}

Complete code: ideone.com/IAKcD

correct me where i am wrong .........i am trying to do is in O(n).....but is in O(nlgn)

int breath_left(struct node* Root)
{
	if(!Root)
		return 0;
	return max(breath_left(Root->left)+1,breath_left(Root->right)-1);
}
int breath_right(struct node* Root)
{
	if(!Root)
		return 0;
	return max(breath_right(Root->right)+1,breath_right(Root->left)-1);
}
int breath(struct node* Root)
{
	return (breath_left(root)+breath_right(root)-1);
}
void verticalAtLevel(struct node* Root,int level)
{
	if(!Root)
		return;
	if(level==1)
		printf("%d  ",Root->data);
	verticalAtLevel(Root->left,level-1);
	verticalAtLevel(Root->right,level+1);
	
	
}
void vertical_travers(struct node* Root)
{
	int breathLeft=breath_left(Root);
	int i=0;
	for(i=breathLeft;i>=(-breath_right(Root));i--){
		verticalAtLevel(Root,i);
		printf("\n");}
		
}

can some one pls elaborate the question.. i cant understand!!

Pre-order tree traversal

public class Node {

private Node right;
private Node left;
private int nodeValue;

public Node (  )
{
// a Java constructor
}

public Node leftNode() {return left;}
public Node rightNode() {return right;}
public int getNodeValue() {return nodeValue;}

}

void preOrder (Node root)
{

  if(root == null) return;
  
  root.printNodeValue();
  
  preOrder( root.leftNode() );
  preOrder( root.rightNode() ); 
  
}