深度优先和广度优先

Xikl · Jan 9, 2019 · d399ba0 · d399ba0
1 parent db6c446
commit d399ba0
Showing 1 changed file with 3 additions and 3 deletions.
diff --git a/src/main/java/com/ximo/datastructuresinaction/bst/BinarySearchTree.java b/src/main/java/com/ximo/datastructuresinaction/bst/BinarySearchTree.java
@@ -125,7 +125,7 @@ private boolean contains(Node node, E element) {
     /**
      * 非递归前序遍历
      * 根左右
-     *
+     * 深度优先遍历
      */
     public void inOrderNR() {
         if (root == null) {
@@ -146,8 +146,8 @@ public void inOrderNR() {
     }
 
     /**
-     * breadth-first
-     * 深度优先遍历
+     * 层序遍历
+     * 广度优先遍历
      */
     public void levelOrder() {
         Queue<Node> queue = new LinkedList<>();