Technical Interview

Home
Added Recently
Data Structures
Puzzles
Google & Microsoft
C/C++ Questions
Java Interview Questions
Quantitative Problems
Algorithms
Featured Articles
Amazon Interview Question
Compaq Interview Question
Technical Interview
Interview Process
Introduction Questions
Object Oriented
Google Pages
Fundamental Questions
Resume Tips
Links
Contact Us
Submit Question/Answer

Data Structures Questions and Answers for Technical Interviews

 

Question: What is almost complete binary tree?.




Answer:An almost complete binary tree is a tree in which each nodethat has a right child also has a left child. Having a left child does not require a node to have a right child. Stated alternately, an almost complete binary tree is a tree where for a right child, there is always a left child, but for a left child there may not be a right child.The number of nodes in a binary tree can be found using this formula: n = 2^h Where n is the amount of nodes in the tree, and h is the height of the tree.




More Questions and Answers @ Cracking the Coding Interview: Fourth Edition (308 page e-book / PDF)

Delivered instantly as a PDF via email. For Software Engineers & SDETs      

·         150 programming interview questions and answers

·         5 proven approaches to crack algorithm questions

·         10 mistakes candidates make, and how to avoid them.

·         How to prepare for technical and behavioral questions without wasting your time!

30 Day Money Back Guarantee: Don't love the book? We'll give you your money back!
 

More Info