recursion programming
1 public class Solution { 2 public boolean isSymmetric(TreeNode root) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(root == null) 6 return true; 7 return checkTwoSubtree(root.left, root.right); 8 } 9 private boolean checkTwoSubtree(TreeNode leftTree, TreeNode rightTree) 10 { 11 if(leftTree == null && rightTree == null) 12 return true; 13 if(leftTree == null || rightTree == null) 14 return false; 15 if(leftTree.val != rightTree.val) 16 return false; 17 return checkTwoSubtree(leftTree.left, rightTree.right) && checkTwoSubtree(leftTree.right, rightTree.left); 18 } 19 }
【推荐】还在用 ECharts 开发大屏?试试这款永久免费的开源 BI 工具!
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步