求树的最大和最小深度

chenweijie · chenweijie · commit 802695a54557 · 2020-08-31T01:22:05.000+08:00
diff --git a/src/main/java/com/chen/algorithm/study/test144/Solution1.java b/src/main/java/com/chen/algorithm/study/test144/Solution1.java
@@ -0,0 +1,37 @@
+package com.chen.algorithm.study.test144;
+
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2020-05-11 23:21
+ */
+public class Solution1 {
+
+    public class TreeNode {
+        int val;
+        TreeNode left;
+        TreeNode right;
+
+        TreeNode(int x) {
+            val = x;
+        }
+    }
+
+    public List<Integer> preorderTraversal(TreeNode root) {
+        List<Integer> res = new ArrayList<>();
+
+        if (root == null) {
+            return res;
+        }
+
+        res.add(root.val);
+        preorderTraversal(root.left);
+        preorderTraversal(root.right);
+
+        return res;
+    }
+
+}
diff --git a/src/main/java/com/chen/algorithm/study/test94/Solution.java b/src/main/java/com/chen/algorithm/study/test94/Solution.java
@@ -20,10 +20,9 @@ class TreeNode {
         }
     }
 
-    List<Integer> result = new ArrayList<>();
 
     public List<Integer> inorderTraversal(TreeNode root) {
-
+        List<Integer> result = new ArrayList<>();
 
         if (root == null) {
             return result;

Original file line number	Diff line number	Diff line change
`@@ -20,10 +20,9 @@ class TreeNode {`
`20`	`20`	`}`
`21`	`21`	`}`
`22`	`22`
`23`		`- List<Integer> result = new ArrayList<>();`
`24`	`23`
`25`	`24`	`public List<Integer> inorderTraversal(TreeNode root) {`
`26`		`-`
	`25`	`+ List<Integer> result = new ArrayList<>();`
`27`	`26`
`28`	`27`	`if (root == null) {`
`29`	`28`	`return result;`