Update check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree.py

Author: kamyu104

Python/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree.py

@@ -26,7 +26,7 @@ def isValidSequence(self, root, arr):
                     continue
                 if depth+1 == len(arr) and node.left == node.right:
                     return True
-                new_q.extend(child for child in (node.left, node.right) if child)
+                new_q.extend(child for child in (node.left, node.right))
             q = new_q
         return False