zoukankan      html  css  js  c++  java
  • Same Tree (二叉树DFS)

    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.

    两颗二叉树完全相同,也就是某个节点的左右孩子,和另外一棵树的的对应节点的左右孩子相等。和镜像对称树那题类似。

    代码:

    class Solution {
    public:
        bool isSameTree(TreeNode *p, TreeNode *q) {
            if(p==NULL&&q==NULL) return true;
            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);
        }
    };
  • 相关阅读:
    OSI模型白话
    并发
    初始化与清理
    多线程
    recyclerview Adapter
    recyclerview刷新
    surfaceview
    viewgroup绘制流程
    view配置
    项目遇到的问题
  • 原文地址:https://www.cnblogs.com/fightformylife/p/4079329.html
Copyright © 2011-2022 走看看