二叉树
菜鸡快飞
这个作者很懒,什么都没留下…
展开
-
二叉树遍历
94中序 class Solution { public List<Integer> inorderTraversal(TreeNode root) { ArrayList<Integer> res = new ArrayList<>(); order(root, res); return res; } private void order(TreeNode root, ArrayList res)原创 2022-05-22 19:28:29 · 62 阅读 · 0 评论 -
124二叉树最大路径和
124 class Solution { int res; public int maxPathSum(TreeNode root) { res = Integer.MIN_VALUE; dfs(root); return res; } private int dfs(TreeNode root){ if(root == null) return 0; int left = dfs(root.le原创 2022-05-22 18:27:52 · 130 阅读 · 0 评论 -
二叉树的层序遍历
102 // 层序遍历 递归 class Solution { List<List<Integer>> res; public List<List<Integer>> levelOrder(TreeNode root) { res = new ArrayList<>(); if(root == null) return res; dfs(root, 1); return原创 2022-05-13 20:15:32 · 53 阅读 · 0 评论