Hi Reader.
for problem in algorithm section ,
872. Leaf-Similar Trees
when i localy ran my solution for input test case
[1,2]
[2,2]
it was showing accepted (my programe returned true)
but when i submiited my same solution it was rejected for above mentioned test case as my programe had returned false. Can anyone help me out here please ? my solution is as given below
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
l1 = []
l2 = []
def leafSimilar(self, root1: TreeNode, root2: TreeNode) -> bool:
self.traverseT(root1,1)
self.traverseT(root2,2)
return(self.l1 == self.l2)
def traverseT(self,root,treeid):
if not root.left and not root.right:
if treeid == 1:
self.l1.append(root.val)
else:
self.l2.append(root.val)
if root.left:
self.traverseT(root.left,treeid)
if root.right:
self.traverseT(root.right,treeid)