Li Kou daily one question brushing summary: binary tree chapter (continuous update)

100. Same tree Easy recursive 2022/3/23

Here are the root nodes of two binary trees p and q , Write a function to check whether the two trees are the same .
If two trees are the same in structure , And the nodes have the same value , They are the same .

Method 1 ： Best recursion , Judge whether the left subtree and the right subtree are the same to determine whether the tree is the same , The difficulty is to write full boundary conditions ： Null returns true . If one party is empty and the other party is not empty, return false , If the values are not equal, it is false .

class Solution { 
    
public:
    bool isSameTree(TreeNode* p, TreeNode* q)