程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> [leetcode]Same Tree

[leetcode]Same Tree

編輯:C++入門知識

[leetcode]Same Tree


問題描述:

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.



代碼:

public class SameTree { //java
	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 || q.val != p.val)
			 return false;
		 
		 boolean lsame = isSameTree(p.left, q.left);
		 boolean rsame = isSameTree(p.right, q.right);
		 
		 return lsame&&rsame;
	 }
	 
	 
}


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved