update binary search tree

Author: Zu3zz

README.md

@@ -82,3 +82,5 @@
   > ![最大索引堆优化](./static/index-maxheap-reverse.png)
   - reverse数组more detail
   > ![reverse](./static/reverse-detail.png)
+  - 二项堆
+  - 斐波那契堆

binary-search-tree/binary-search-tree/main.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+using namespace std;
+
+template<typename Key, typename Value>
+class BST{
+
+private:
+  struct Node{
+    Key key;
+    Value value;
+    Node *left;
+    Node *right;
+
+    Node(Key key, Value value){
+      this->key = key;
+      this->value = value;
+      this->left = this->right = NULL;
+    }
+  };
+  Node *root;
+  int count;
+
+public:
+  BST(){
+    root = NULL;
+    count = 0;
+  }
+  ~BST(){
+    // TODO: ~BST()
+  }
+  int size(){
+    return count;
+  }
+  bool isEmpty(){
+    return count == 0;
+  }
+
+};
+
+int main(){
+  cout<<"hello"<<endl;
+  return 0;
+}

binary-search-tree/binary-search/main.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+
+using namespace std;
+
+template <typename T>
+
+int binarySearch(T arr[], int n, T target)
+{
+  // 在arr[l...r]之间查找target
+  int l = 0, r = n - 1;
+  while (l <= r)
+  {
+    int mid = (r - l) / 2 + l;
+    if (arr[mid] == target)
+      return mid;
+    if (target < arr[mid])
+      // 在arr[l...mid-1]之间查找target
+      r = mid - 1;
+    else // target > arr[mid]
+      // 在arr[mid+1...r]之中查找target
+      l = mid + 1;
+  }
+  return -1;
+}