Source of the topic
https://leetcode.com/problems/same-tree/
Given binary trees, write a function to check if they is equal or not.
The binary trees is considered equal if they is structurally identical and the nodes has the same value.
Test instructions Analysis
Input:twon binary Tree
Output:equal?
Conditions: Judging whether two binary trees are equal.
Topic ideas
Iterate through them to see if they are equal.
AC Code (PYTHON)
1 #Definition for a binary tree node.2 #class TreeNode (object):3 #def __init__ (self, x):4 #self.val = x5 #self.left = None6 #self.right = None7 8 classsolution (object):9 defissametree (self, p, q):Ten """ One : Type P:treenode A : Type Q:treenode - : Rtype:bool - """ the defDFS (p, q): - ifp = = None andQ! =None: - returnFalse - ifP! = None andQ = =None: + returnFalse - ifp = = None andQ = =None: + returnTrue A ifP.val! =Q.val: at returnFalse - returnDFS (P.left, q.left) anddfs (p.right, q.right) - - returndfs (P,Q) -
[Leetcode] (python): Same Tree