Question

A full binary tree is a binary tree with the leaves on the same level. Add a method in the BinaryTree class to return True if the tree is full. (Hint: The number of nodes in a full binary tree is 2depth -1.)

answer must be in python.

Answer 1

'''
Assuming the tree node has left and right pointers
'''

def findDepth(root):
        if root is None:
                return 0
        return 1 + max(findDepth(root.left), findDepth(root.right))


def countNodes(root):
        if root is None:
                return 0
        return 1 + countNodes(root.left) + countNodes(root.right)

        
        
def isFullTree(root):
        h = findDepth(root)
        n = countNodes(root)
        return n == (-1 + 2**h)

Please upvote, as i have given the exact answer as asked in question. Still in case of any issues in code, let me know in comments. Thanks!