[Leetcode]-Same Tree, leetcode-sametree

Source: Internet
Author: User

[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.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.