JAVA_Symmetric Tree_LeetCode 101

JAVA_Symmetric Tree_LeetCode 101 Symmetric Tree 풀이 class Solution { public boolean isSymmetric(TreeNode root) { return symmetricTree( root.left, root.right ); } public boolean symmetricTree(TreeNode left, TreeNode right) { if( left == null || right == null ) return left == right; if( left.val != right.val ) return false; return symmetricTree(left.left, right.right) && symmetricTree(left.right, right.left); } } * 출처 Level up your coding skills and quickly land a job. This is the best place to exp...

원문링크 : JAVA_Symmetric Tree_LeetCode 101