Adobe Interview Question for Developer Program Engineers


Country: India
Interview Type: In-Person




Comment hidden because of low score. Click to expand.
0
of 0 vote

Level order traversal in a binary search tree can be done using breadth first search with starting at root of the BST then it will print all the nodes in a level at one time. You can watch the solution and wonderful explanation of this at
youtu.be/5pNIul92cj0

- Anonymous July 03, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

levelBst(strcut node *root)
{
	struct Queue *Q=CreateQueue();
	if(!root)
		retun;
	Enqueue(Q,root);
	Enqueue(Q,NULL);
	while(!isEmpty(Q))
	{
		root=Dequeue(Q);
		if(!root)
		{
			if(!isEmpty(Q))
				Enqueue(Q,NULL);
		}
		else
		{
			printf("%d",root->data);
			if(root->left)
				Enqueue(Q,root->left);
			if(root->right)
				Enqueue(Q,root->right);			
		}

	}
return;
}

- Pranav September 04, 2012 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More