100. Same Tree
来源:互联网 发布:淘宝店铺页面装修图 编辑:程序博客网 时间:2024/06/01 19:38
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.
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def isSameTree(self, p, q): """ :type p: TreeNode :type q: TreeNode :rtype: bool """ if (p and not q) or (q and not p): return False if (not p) and (not q): return True return p.val == q.val and self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
阅读全文
0 0
- [LeetCode]100.Same Tree
- LeetCode 100. Same Tree
- 100.Same Tree
- 【LeetCode】100.Same Tree
- [Leetcode] 100. Same Tree
- [Leetcode] 100. Same Tree
- LeetCode --- 100. Same Tree
- LeetCode 100. Same Tree
- [leetcode] 100.Same Tree
- 100.Same Tree
- 100. Same Tree
- 100.Same Tree
- 100. Same Tree
- 100. Same Tree
- 100. Same Tree
- leetCode 100. Same Tree
- 100. Same Tree
- [LeetCode]100. Same Tree
- 【PAT】【Advanced Level】1080. Graduate Admission (30)
- Css sprites(Css精灵)
- session与cookie的介绍和两者的区别之其相互的关系
- OpenGL 笔记(二) 图元的属性
- 欢迎使用CSDN-markdown编辑器
- 100. Same Tree
- MySQL删除重复记录
- runable和thread的区别
- csu 1777
- python 连接 mongodb pymongo.Connection 不能用
- Vue+WebPack游戏设计:自动背景贴图和游戏主循环的实现
- 2018滴滴校招(秋招)内推笔试编程题题解
- 单机多实例MYSQL主从复制
- 同敏捷前辈聊天的一些记录