Chapter 05 section 06 java Queue interface used in BST level order tr…

…averse.
WorriesL · May 1, 2018 · ec64aff · ec64aff
1 parent c126be7
commit ec64aff
Showing 1 changed file with 2 additions and 1 deletion.
diff --git a/...earch-Tree/Course Code (Java)/06-Binary-Search-Tree-Level-Traverse/src/bobo/algo/BST.java b/...earch-Tree/Course Code (Java)/06-Binary-Search-Tree-Level-Traverse/src/bobo/algo/BST.java
@@ -1,6 +1,7 @@
 package bobo.algo;
 
 import java.util.LinkedList;
+import java.util.Queue;
 
 // 二分搜索树
 // 由于Key需要能够进行比较，所以需要extends Comparable<Key>
@@ -72,7 +73,7 @@ public void postOrder(){
     public void levelOrder(){
 
         // 我们使用LinkedList来作为我们的队列
-        LinkedList<Node> q = new LinkedList<Node>();
+        Queue<Node> q = new LinkedList<Node>();
         q.add(root);
         while( !q.isEmpty() ){