https://demo.ritambhara.in/almost-complete-binary-tree/ Coding / System Design Interviews Sat, 18 Jun 2016 15:06:24 +0000 hourly 1 https://wordpress.org/?v=6.7.2 https://demo.ritambhara.in/almost-complete-binary-tree/#comment-2011 Sat, 18 Jun 2016 15:06:24 +0000 http://www.ritambhara.in/?p=3800#comment-2011 Kamal Rawat Agreed

]]> https://demo.ritambhara.in/almost-complete-binary-tree/#comment-2010 Sat, 18 Jun 2016 15:06:08 +0000 http://www.ritambhara.in/?p=3800#comment-2010 Kamal Rawat Agreed

]]> https://demo.ritambhara.in/almost-complete-binary-tree/#comment-2009 Sat, 18 Jun 2016 09:50:14 +0000 http://www.ritambhara.in/?p=3800#comment-2009 1. All Leaf nodes of complete binary tree are at same level – False
2. In complete binary tree, there will never be a node that has only one child and the other child is NULL – False

]]> https://demo.ritambhara.in/almost-complete-binary-tree/#comment-2008 Sat, 18 Jun 2016 09:47:26 +0000 http://www.ritambhara.in/?p=3800#comment-2008 A complete Binary tree of height h has ((2 to the pow of h)-1) nodes is wrong. This property is true for full binary tree.
*A complete Binary tree of height h has atleast (2 to the pow of h-1) nodes and atmost ((2 to the pow of h)-1) nodes

]]>