Interview Question for Software Engineer / Developers


Country: United States
Interview Type: Phone Interview




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

Heap is a data structure mostly implemented using array but much more easier to visualize as tree. Its a complete tree and all element in the tree satisfy the property that child's are smaller the then parent (in case of max heap) or opposite in case of min heap. So minimum or maximum element is at the root.
It can be used in any place where u need to keep track of max or min in a bunch of number...like priority queue.

- nguptak February 20, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

refer above answer. that is correct..!!

- appy February 20, 2013 | Flag


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