diff --git a/Programming_Languages/C++/BinaryIndexedTree.cpp b/Programming_Languages/C++/BinaryIndexedTree.cpp
new file mode 100644
index 0000000..d345dc9
--- /dev/null
+++ b/Programming_Languages/C++/BinaryIndexedTree.cpp
@@ -0,0 +1,35 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+void update(int index,int value,int* BIT,int n){
+	for(;index <= n ; index += index&(-index)){
+		BIT[index] += value;
+	}
+}
+
+int query(int index,int* BIT){
+	int sum=0;
+	for( ; index>0 ; index -= index&(-index)){
+		sum += BIT[index];
+	}
+	return sum;
+}
+
+int main(){
+	int n;
+	cin >> n;
+	
+	int* arr = new int[n+1]();
+	int* BIT = new int[n+1]();
+	
+	for(int i=1;i<=n;i++){
+		cin >> arr[i];
+		update(i,arr[i],BIT,n);
+	}
+
+	cout << "Sum of first 5 elements " << query(5,BIT) <<endl;
+	cout << "Sum of elements from 2 index to 6 index " << query(6,BIT) -
+	
+	query(1,BIT)<<"\n";
+	return 0;
+}