100. Same Tree
来源:互联网 发布:西安软件行业成都 编辑:程序博客网 时间:2024/06/05 19:23
原文题目:
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.
读题:
给定两个二叉树,判断二叉树是否相等,判断条件是二叉树的结构一样并且各个节点的value也一样
解题思路:
有两个方法,递归和非递归,递归是采用DFS方法遍历二叉树,对每个节点和左右子树进行判断;非递归方法可以采用栈或者队列存储两棵树进行逐一比较
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = None'''递归'''class Solution(object):def isSameTree(self, p, q):""":type p: TreeNode:type q: TreeNode:rtype: bool"""if p and q:mid = p.val == q.vall = self.isSameTree(p.left, q.left)r = self.isSameTree(p.right, q.right)return mid and l and rreturn p == q'''非递归'''class Solution(object):def isSameTree(self, p, q):""":type p: TreeNode:type q: TreeNode:rtype: bool"""stack = [(p, q)]while stack:p, q = stack.pop()if not p and not q:continueif not p or not q:return Falseif p.val == q.val:stack.append((p.right, q.right))stack.append((p.left, q.left))else:return Falsereturn True
阅读全文
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
- MySQL5.5.27安装教程
- genymotion INSTALL_FAILED_NO_MATCHING_ABIS错误
- Boost智能指针学习
- 升级Cmake
- OpenCVForUnity 透视校正,透视变换
- 100. Same Tree
- C与C++易混乱的点 总结
- 杂记——百鸡问题
- Git submodule添加子项目/库
- spring每个jar对应的作用
- 树莓派3b连接超声波测距探头实现测距功能(C语言版)
- jQueryday05补充(外内添加节点替换 节点操作)
- 使用Apriori进行关联分析(二)
- codeforces 16E Fish (概率-期望DP)