首页 > TAG信息列表 > isMirror
对称二叉树
使用递归实现 /** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func isSymmetric(root *TreeNode) bool { return isMirror(root, root) } func isMirror(p, q *TreeNode)boLeetCode不定时刷题——Symmetric Tree
Symmetric Tree Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following [1,2,2,null,3,null,3]判断对称二叉树
mirror public boolean isMirror(node left, node right){ if(null == right && null == left){ return true; }else if( null == right || null == left ){ return false; } if(right.val != left.val)