Map Basics

06-Binary-Search-Tree/01-Binary-Search-Tree-Basics/src/Main.java

@@ -7,19 +7,19 @@ public class Main {
  public static void main(String[] args) {
 
  BST<Integer> bst = new BST<>();
- int[] nums = {3, 4, 5, 2, 8, 4};
+ int[] nums = {5, 6, 3, 8, 4, 2};
  for (int num : nums)
  bst.add(num);
 
- bst.levelOrder();
-// bst.inOrder();
-// System.out.println();
+// bst.levelOrder();
+ bst.inOrder();
+ System.out.println();
 //
-// bst.postOrder();
-// System.out.println();
+ bst.postOrder();
+ System.out.println();
 // bst.preOrderNR();
 // System.out.println();
-// bst.preOrder();
-// System.out.println(bst);
+ bst.preOrder();
+ System.out.println();
  }
 }

07-Set-and-Map/03-Map-Basics/src/Main.java

@@ -0,0 +1,11 @@
+/**
+ * @Auther: lss
+ * @Date: 2019/1/31 21:50
+ * @Description:
+ */
+public class Main {
+ public static void main(String[] args) {
+
+
+ }
+}

07-Set-and-Map/03-Map-Basics/src/Map.java

@@ -0,0 +1,21 @@
+/**
+ * @Auther: lss
+ * @Date: 2019/2/21 15:34
+ * @Description:
+ */
+public interface Map<K, V> {
+
+ void add(K key, V value);
+
+ V remove(K key);
+
+ boolean contains(K key);
+
+ V get(K key);
+
+ void set(K key, V value);
+
+ int getSize();
+
+ boolean isEmpty();
+}