In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. The height of the tree is always h>0. If the minimum number of nodes in left subtree of left subtree of a tree are 8, then what will be minimum number of nodes in that tree?
