Download Same Tree.py
# Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def isSameTree(self, p, q): """ :type p: TreeNode :type q: TreeNode :rtype: bool """ if p == q: return True try: left = right = True if p.val == q.val: left = self.isSameTree(p.left, q.left) right = self.isSameTree(p.right, q.right) return (left and right) except: return False return False
Leetcode 100 Same Tree problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
self.val = x
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.