BhagvadGeeta Solution which is a Raambaan(Panacea)
Intuition\n Describe your first thoughts on how to solve this problem. \nI dont have any particular thoughts about this problem\nIt just came from my heart and 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nI dont have any particular thoughts about this problem\nIt just came from my heart and eternal source of Lord krishna\nGod is carrying my chariot\nYou know who I am.\nMost importantly you know who he is.\nDo you understand?\nGOD IS CARRYING MY CHARIOT\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nThe approach is that \nFirst you traverse til the leftmost node and then rightmost node\nand return the sum of subnodes in 0th index and number of nodes in 1st index\n\nWhen you completed both the traversals you add the 0th index of both the list and find the average of the sum of subnodes per number of subnodes which should be equal to the value of the root\nif it does then we will increment the counter (ctr) \nAt the end we will return the counter(ctr)\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(2*n)\n\n# Code\n```\n# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\nclass Solution:\n    def __init__(self):\n        self.ctr=0\n    def averageOfSubtree(self, root: Optional[TreeNode]) -> int:\n        def recur(root):\n            if root is None:\n                return [0,0]\n            list1=recur(root.left)\n            list2=recur(root.right)\n            sub_node_sum=list1[0]+list2[0]+root.val\n            sub_node_count=list1[1]+list2[1]+1\n            if((int(sub_node_sum/sub_node_count))==root.val):\n                print(root.val)\n                self.ctr+=1\n            return [sub_node_sum,sub_node_count]\n        recur(root)\n        return self.ctr\n```
['Python3']