[Leetcode]-Same Tree, leetcode-sametree
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
Hide Tags: Tree, Depth-first Search
Question: Determine whether the two binary trees are identical, including depth and node value.
Idea: recursively determine whether the values of the left and right sons of a node are equal
/*** Definition for a binary tree node. * struct TreeNode {* int val; * struct TreeNode * left; * struct TreeNode * right; *}; */bool isSameTree (struct TreeNode * p, struct TreeNode * q) {if (p = NULL & q = NULL) return true; if (p! = NULL & q = NULL) return false; if (p = NULL & q! = NULL) return false; if (p-> val! = Q-> val) return false; return isSameTree (p-> left, q-> left) & isSameTree (p-> right, q-> right );}
Copyright Disclaimer: This article is an original article by the blogger and cannot be reproduced without the permission of the blogger.