leetcode 100. Same Tree
来源:互联网 发布:淘宝主图尺寸750 编辑:程序博客网 时间:2024/06/16 17:27
题目:
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.
判断两棵二叉树是否相等,即结构相同,且对应的节点具有相同的值
思路:由树的前序、中序和后序遍历,想到用递归的方法,先判断根节点是否相同,再依次判断左子树和右子树是否相同。
代码AC:
0 0
- [LeetCode]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
- [leetcode] 100.Same Tree
- leetCode 100. Same Tree
- [LeetCode]100. Same Tree
- 100. Same Tree LeetCode
- LeetCode 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
- acm程序设计书中题目第s题解析
- 《ACM程序设计》书中题目 S-19 Message queue
- 位运算
- React从入门到精通系列之(14)refs和DOM元素
- HDU
- leetcode 100. Same Tree
- docker系列一,认识初步
- <table>表格标签
- easyui 生成 菜单结构树 02
- 【BZOJ3996】【TJOI2015】线性代数(最小割)
- 2的次幂表示
- 决策树
- 第二十一、Java之main方法详解
- 287. Find the Duplicate Number