10 2022 档案

Leecode 111.二叉树的最小深度
摘要：/* * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { 阅读全文
posted @ 2022-10-11 08:13 NOE42 阅读(16) 评论(0) 推荐(0) 编辑
Leecode104 二叉树的最大深度
摘要：//DFS解法 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(in 阅读全文
posted @ 2022-10-10 19:29 NOE42 阅读(18) 评论(0) 推荐(0) 编辑
101.对称二叉树 100.相同的树
摘要：注意compare比较的只是左右节点！！！/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} 阅读全文
posted @ 2022-10-06 11:11 NOE42 阅读(17) 评论(0) 推荐(0) 编辑
226.翻转二叉树,前序遍历解法
摘要：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { 阅读全文
posted @ 2022-10-06 10:22 NOE42 阅读(18) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示