1. In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is atmost 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is :
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use