complete binary tree notes complete binary tree of depth is tree with nodes in which these nodes can be numbered sequentially from to nas if it would have been the first nodes in full binary tree of depth complete binary tree with depth is shown in figure figure complete binary tree properties of binary tree main properties of binary tree are if binary tree contains nodesthen it contains exactly edges binary tree of height has nodes or less if we have binary tree containing nodesthen the height of the tree is at most and at least ceiling log ( if binary tree has nodes at level thenit has at most nodes at level the total number of nodes in binary tree with depth (root has depth zerois + task in figure total no of node present binary representation if binary tree is complete binary treeit can be represented using an array capable of holding elements where is the number of nodes in complete binary tree if the tree is an array of elementswe can store the data values of the ith node of complete binary tree with nodes at an index in an array tree that means we can map node to the ith index in the arrayand the parent of node will get mapped at an index / whereas the left child of node gets mapped at an index and the right child gets mapped at an index examplea complete binary tree with depth having the number of nodes can be represented using an array of as shown in figure lovely professional university