leet树
ldd儆儆
这个作者很懒,什么都没留下…
展开
-
leet530:二叉搜索树的最小绝对差
static TreeNode pre = null;static int res = Integer.MAX_VALUE;public static int getMinimumDifference(TreeNode root) { inOrder(root); return res;}public static void inOrder(TreeNode root) ...原创 2019-12-18 10:35:31 · 62 阅读 · 0 评论 -
leet563:二叉树的坡度
public static int findTilt(TreeNode root) { traverse(root); return tilt;}public static int traverse(TreeNode root) { if(root==null ) return 0; int left=traverse(root.left);...原创 2019-12-17 11:19:46 · 75 阅读 · 0 评论 -
leet589:N叉树的前序遍历
递归 List<Integer> list = new ArrayList<Integer>(); // 创建list保存数据 public List<Integer> preorder(Node root) {//1ms if(root == null) return list;// 判断如果一开始的root为...原创 2019-12-16 14:29:19 · 86 阅读 · 0 评论 -
leet590: N叉树的后序遍历
递归://public List<Integer> postorder1(Node root) {//1ms List<Integer> res = new ArrayList<>(); if(root == null) return res; helper(root,res); return res;}private...原创 2019-12-16 14:26:44 · 56 阅读 · 0 评论 -
leet235:二叉搜索树的最近公共祖先
递归public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {//7ms if(root.val>p.val && root.val>q.val) return lowestCommonAncestor(root.left, p, q); if(root....原创 2019-12-16 14:04:52 · 78 阅读 · 1 评论 -
leet437:路径总和 III
public int pathSum1(TreeNode root, int sum) {//5ms return pathSum(root, sum, new int[1000], 0);}public int pathSum(TreeNode root, int sum, int[] array/*保存路径*/, int p/*指向路径终点*/) { if (root ...原创 2019-12-16 14:03:24 · 101 阅读 · 0 评论 -
leet111:二叉树的最小深度
public int minDepth(TreeNode root) {//1ms if(root == null) return 0; if ((root.left == null) &&(root.right == null)) return 1; int minDepth = Integer.MAX_VALUE;...原创 2019-12-16 11:18:03 · 139 阅读 · 0 评论 -
leet110:平衡二叉树
public boolean isBalanced1(TreeNode root) { return depth1(root)!=-1;}private int depth1(TreeNode root) { if(root ==null) return 0; int left = depth1(root.left); if(left ==...原创 2019-12-16 10:54:34 · 72 阅读 · 0 评论 -
leet404:左叶子之和
int sumLeft = 0;public int sumOfLeftLeaves(TreeNode root) { if(root == null) return sumLeft; if (root.left!=null && root.left.left == null &&root.left.right ==null)...原创 2019-12-16 10:35:55 · 99 阅读 · 0 评论 -
leet104:二叉树的最大深度
public int maxDepth(TreeNode root) { if(root == null) return 0; else { int leftHeight = maxDepth(root.left); int rightHeight = maxDepth(root.right); return Mat...原创 2019-12-16 10:08:49 · 93 阅读 · 0 评论