二叉树 中序遍历

crossoverJie · crossoverJie · commit 3acbcbdceeab · 2018-01-04T20:58:00.000+08:00
diff --git a/src/main/java/com/crossoverjie/algorithm/BinaryNode.java b/src/main/java/com/crossoverjie/algorithm/BinaryNode.java
@@ -0,0 +1,102 @@
+package com.crossoverjie.algorithm;
+
+import java.util.LinkedList;
+
+/**
+ * Function:
+ *
+ * @author crossoverJie
+ *         Date: 04/01/2018 18:26
+ * @since JDK 1.8
+ */
+public class BinaryNode {
+    private Object data ;
+    private BinaryNode left ;
+    private BinaryNode right ;
+
+    public BinaryNode() {
+    }
+
+    public BinaryNode(Object data, BinaryNode left, BinaryNode right) {
+        this.data = data;
+        this.left = left;
+        this.right = right;
+    }
+
+    public Object getData() {
+        return data;
+    }
+
+    public void setData(Object data) {
+        this.data = data;
+    }
+
+    public BinaryNode getLeft() {
+        return left;
+    }
+
+    public void setLeft(BinaryNode left) {
+        this.left = left;
+    }
+
+    public BinaryNode getRight() {
+        return right;
+    }
+
+    public void setRight(BinaryNode right) {
+        this.right = right;
+    }
+
+
+    public BinaryNode createNode(){
+        BinaryNode node = new BinaryNode("1",null,null) ;
+        BinaryNode left2 = new BinaryNode("2",null,null) ;
+        BinaryNode left3 = new BinaryNode("3",null,null) ;
+        BinaryNode left4 = new BinaryNode("4",null,null) ;
+        BinaryNode left5 = new BinaryNode("5",null,null) ;
+        BinaryNode left6 = new BinaryNode("6",null,null) ;
+        node.setLeft(left2) ;
+        left2.setLeft(left4);
+        left2.setRight(left6);
+        node.setRight(left3);
+        left3.setRight(left5) ;
+        return node ;
+    }
+
+    @Override
+    public String toString() {
+        return "BinaryNode{" +
+                "data=" + data +
+                ", left=" + left +
+                ", right=" + right +
+                '}';
+    }
+
+
+    /**
+     * 二叉树的层序遍历 借助于队列来实现
+     *
+     * 首先将根节点入队列 然后遍历队列。
+     * 首先将根节点打印出来，接着判断左节点是否为空 不为空则加入队列
+     * @param node
+     */
+    public void levelIterator(BinaryNode node){
+        LinkedList<BinaryNode> queue = new LinkedList<>() ;
+
+        //先将根节点入队
+        queue.offer(node) ;
+        BinaryNode current ;
+        while (!queue.isEmpty()){
+            current = queue.poll();
+
+            System.out.print(current.data+"--->");
+
+            if (current.getLeft() != null){
+                queue.offer(current.getLeft()) ;
+            }
+            if (current.getRight() != null){
+                queue.offer(current.getRight()) ;
+            }
+        }
+    }
+}
