Comments on: Check if a Binary Tree is Complete Binary Tree https://demo.ritambhara.in/check-if-a-binary-tree-is-complete-binary-tree/ Coding / System Design Interviews Mon, 29 Nov 2021 06:26:50 +0000 hourly 1 https://wordpress.org/?v=6.7.2 By: Ali Nauman https://demo.ritambhara.in/check-if-a-binary-tree-is-complete-binary-tree/#comment-6143 Mon, 29 Nov 2021 06:26:50 +0000 http://www.ritambhara.in/?p=1770#comment-6143 Just checkCompleteTree function to check that

if number of nodes is between and including 2^(h-1) – 1 and 2^h – 1 then it is complete otherwise not as complete binary tree is full or perfect to h-1

]]> By: Alex Allen https://demo.ritambhara.in/check-if-a-binary-tree-is-complete-binary-tree/#comment-1931 Tue, 03 Jul 2018 22:57:01 +0000 http://www.ritambhara.in/?p=1770#comment-1931 I agree with Shafiq. This solution is to check for a perfect tree. There are many complete trees that are not perfect trees.

]]> By: Shafiq Ahmed Shaik https://demo.ritambhara.in/check-if-a-binary-tree-is-complete-binary-tree/#comment-1930 Tue, 01 Mar 2016 18:39:57 +0000 http://www.ritambhara.in/?p=1770#comment-1930 This works for only perfect tree.

]]>