Simple 11 lines Python Solution
class Solution(object):\n        def isValidSerialization(self, preorder):\n            def isValid(it):\n                value = next(it, None)\n              
    class Solution(object):\n        def isValidSerialization(self, preorder):\n            def isValid(it):\n                value = next(it, None)\n                if value == None: return False\n                if value != "#":\n                    return isValid(it) and isValid(it) \n                return True\n                \n            it = iter(preorder.split(","))\n            return isValid(it) and next(it, None) == None\nA valid preorder traversal of a unique structured tree should have exact amount of nodes (including null pointers) to reconstruct the tree.
['Python']