diff --git a/Heap.java b/Heap.java
new file mode 100644
index 0000000000000000000000000000000000000000..71b18b5c0c538c8974d6fda269f3b98be0540da9
--- /dev/null
+++ b/Heap.java
@@ -0,0 +1,97 @@
+public class Heap<T extends Comparable<T>> {//堆
+  public T[] heap;
+  public int SIZE;
+  public int count;
+
+  Heap(int size) {
+    SIZE = size;
+    // reference: https://stackoverflow.com/questions/34827626/cannot-be-cast-to-ljava-lang-comparable
+    heap = (T[]) new Comparable[SIZE];
+    count = 0;
+
+  }
+
+
+  public void add(T item) {
+
+    if (count >= SIZE) {
+      // throw new Exception("Heap Overflow");
+      System.out.println("Heap Full");
+      return;
+    }
+    heap[count] = item;
+    int index = count;
+    count++;
+    if (count > 1) {
+      while (index != 0) {
+        if (heap[index].compareTo(heap[(index - 1) / 2]) > 0) {
+          T temp = heap[index];
+          heap[index] = heap[(index - 1) / 2];
+          heap[(index - 1) / 2] = temp;
+        }
+        index = (index - 1) / 2;
+      }
+    }
+
+  }
+
+  public void delete() {
+    heap[0] = heap[count - 1];
+    heap[count - 1] = null;
+    for (int i = 0; i < heap.length - 1; i++) {
+      if (heap[i].compareTo(heap[(2 * i) + 1]) < 0) {
+        T temp = heap[i];
+        heap[i] = heap[(2 * i + 1)];
+        heap[(2 * i + 1)] = temp;
+      }
+      if (heap[i].compareTo(heap[(2 * i) + 2]) < 0) {
+        T index = heap[i];
+        heap[i] = heap[(2 * i + 2)];
+        heap[(2 * i + 2)] = index;
+      }
+      return;
+    }
+  }
+
+  public void print() {//遍历
+    int a = 2;
+    int number = 2;
+    int sum = 1;
+    int spaceCount = 40;
+    int spaceCount1 = 40;
+    for(int j = 0; j < spaceCount;j ++){
+      System.out.print("\u00A0");
+    }
+    System.out.print("                   \t\u00A0");
+    spaceCount--;
+    for (int i = 0; i < heap.length; i++) {//for (T t : heap)
+      System.out.print(heap[i] + "\u00A0");
+      //int pow = (int)Math.pow(2, a);
+      if(i == 0){
+        System.out.println(" ");
+        for(int j = 0; j < spaceCount;j ++){
+          System.out.print("\u00A0");
+        }
+        spaceCount-=2;
+      }
+      else if(number == i){//每一层都换行
+        System.out.println("");
+        for(int j = 0; j < spaceCount;j ++){
+          System.out.print("\u00A0");
+        }
+        spaceCount-=2;
+        number = number + (int)Math.pow(2, a);
+        a++;
+      }
+      if (i == sum){
+        for(int j = 0; j < spaceCount1;j ++){
+          System.out.print("\u00A0");
+        }
+        spaceCount1-=8;
+        sum = 2 * sum + 2;
+      }
+
+    }
+    System.out.println();
+  }
+}
\ No newline at end of file
diff --git a/README.md b/README.md
index e931f2f0393b17470887781a3e4325a8e502941d..41aca87a2caf0d420ec69ba324b7a612a5db5f15 100644
--- a/README.md
+++ b/README.md
@@ -7,11 +7,12 @@
 
 ### 截止日期
 
-下次实验课上课前（12.16)
+- 基础-1 下次实验课上课前（12.16)
+- 基础-2 12.23
 
 ### 基础
 
-1. 实现⼀个小顶堆或者⼤顶堆
+1. 实现小顶堆或者大顶堆
  - (1) 定义堆的数据结构
  - (2) 实现入堆函数
  - (3) 实现出堆函数
@@ -20,7 +21,7 @@
 ### 进阶
 
 1. 利用优先级队列合并K个有序数组
-2. 求⼀组动态数据集合的最⼤Top K
+2. 求一组动态数据集合的Top K
 
 ## 工作流程
 
diff --git a/Test.java b/Test.java
new file mode 100644
index 0000000000000000000000000000000000000000..27ea278c325a533c8a88e77fd95a17db8aa72263
--- /dev/null
+++ b/Test.java
@@ -0,0 +1,11 @@
+public class Test {
+    public static void main(String[] args) {
+        Heap heap = new Heap(50);
+        for (int i = 0; i <= 50; i++) {
+            heap.add(i);
+        }
+        heap.print();
+        //heap.delete();
+        //heap.print();
+    }
+}
\ No newline at end of file