LeetCode:Same Tree
2015-06-24 20:05
393 查看
Same Tree
Total Accepted: 65115 TotalSubmissions: 155756My Submissions
Question
Solution
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
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */
方法一:递归
public boolean 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; } boolean l=isSameTree(p.left,q.left); boolean r=isSameTree(p.right,q.right); return l&&r; }
方法二:BFS(广度优先遍历)[LinkedList实现、add()、poll()]
public boolean isSameTree(TreeNode p, TreeNode q) { if(p==null && q==null){ return true; } if(p==null || q==null){ return false; } LinkedList<TreeNode> queue1 = new LinkedList<TreeNode>(); LinkedList<TreeNode> queue2 = new LinkedList<TreeNode>(); queue1.add(p); queue2.add(q); while(!queue1.isEmpty()){ TreeNode n1 = queue1.poll(); TreeNode n2 = queue2.poll(); if(n1.val!=n2.val){ return false; } if(n1.left!=null && n2.left!=null){ queue1.add(n1.left); queue2.add(n2.left); }else if(!(n1.left==null && n2.left==null)){ return false; } if(n1.right!=null&&n2.right!=null){ queue1.add(n1.right); queue2.add(n2.right); }else if(!(n1.right==null && n2.right==null)){ return false; } } return true; }
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解
- LeetCode [Day 6] ZigZag Conversion 题解
- LeetCode 2: Add Two Numbers (JAVA)
- LeetCode 1: Two Sum (JAVA)