#0918 second commit

Author: 657122411

src/com/blankj/study/temp/Test04.java

@@ -3,10 +3,11 @@
 import com.blankj.study.base.BinaryTreeNode;
 
 import java.util.LinkedList;
+import java.util.Stack;
 
 
 /**
- * 二叉树层序遍历
+ * 二叉树遍历
  */
 public class Test04 {
     public static void main(String[] args) {
@@ -22,11 +23,15 @@ public static void main(String[] args) {
         tree1.setRchild(tree4);
         tree2.setLchild(tree5);
 
+        System.out.println("BFS");
         bfs(tree);
 
+        System.out.println("DFS");
+        dfs(tree);
 
     }
 
+    // 广度优先（层序）遍历
     public static void bfs(BinaryTreeNode node) {
         if (node == null) {
             return;
@@ -47,4 +52,27 @@ public static void bfs(BinaryTreeNode node) {
             }
         }
     }
+
+    public static void dfs(BinaryTreeNode node){
+        if (node == null) {
+            return;
+        }
+        Stack<BinaryTreeNode> stack = new Stack();
+        stack.push(node);
+
+        while (!stack.isEmpty()) {
+            BinaryTreeNode tmp = stack.pop();
+            System.out.println(tmp.getData());
+
+            if (tmp.getRchild() != null) {
+                stack.push(tmp.getRchild());
+            }
+
+            if (tmp.getLchild() != null) {
+                stack.push(tmp.getLchild());
+            }
+
+
+        }
+    }
 }

src/com/blankj/study/temp/Test05.java

@@ -0,0 +1,59 @@
+package com.blankj.study.temp;
+
+import com.blankj.study.base.Node;
+
+/**
+ * 翻转链表
+ */
+public class Test05 {
+
+    public static void main(String[] args){
+        Node head = new Node("head");
+        Node node1 = new Node("1");
+        Node node2 = new Node("2");
+        Node node3 = new Node("3");
+        Node node4 = new Node("4");
+        Node node5 = new Node("5");
+
+        head.setNext(node1);
+        node1.setNext(node2);
+        node2.setNext(node3);
+        node3.setNext(node4);
+        node4.setNext(node5);
+        node5.setNext(null);
+
+        say(head);
+        System.out.println("reverse");
+
+        Node reverse = reverseList(head);
+        say(reverse);
+
+
+    }
+
+    public static void say(Node node){
+        if(node==null){
+            return;
+        }
+
+        while(node.getNext()!=null){
+            System.out.println(node.getData());
+            node = node.getNext();
+        }
+    }
+
+    public static Node reverseList(Node head){
+        Node pre = null;
+        Node next = null;
+
+        while(head!=null){
+            next = head.getNext();
+            head.setNext(pre);
+            pre = head;
+            head = next;
+        }
+
+        return pre;
+    }
+
+}