diff --git a/CorrectTree.cpp b/CorrectTree.cpp
new file mode 100644
index 0000000..359a54c
--- /dev/null
+++ b/CorrectTree.cpp
@@ -0,0 +1,207 @@
+#include <iostream>
+
+using namespace std;
+
+class treeitem {
+    
+    private:
+    int value;
+    treeitem *l,*r,*f;
+    treeitem(int x=0) {
+        value=x;
+        l=NULL;
+        r=NULL;
+        f=NULL;
+    }
+    ~treeitem()
+    {
+		value=0;
+		l=NULL;
+		r=NULL;
+		f=NULL;
+	}
+    friend class tree;
+};
+class tree {
+    private:
+    treeitem *root;
+    public:
+    tree () {
+        root=new treeitem();
+        root= NULL;
+    }
+    
+    void add(int x) {
+        treeitem *w,*an;
+        int z;
+        if(root == NULL) {
+            root = new treeitem(x);
+            return;
+        }
+        for(w=root;w!=NULL; ) {
+            if( x == w->value) {
+                cout << "Odinakoviy Element" << endl;
+                return;
+            }
+            else if(x > w->value) {
+                an=w;
+                w=w->r;
+                z=2;
+            }
+            else if(x < w->value) {
+                an=w;
+                w=w->l;
+                z=1;
+            }
+        }
+        w=new treeitem(x);
+        w->f=an;
+        if(z==1) {
+            an->l=w;
+        }
+        if(z==2) {
+            an->r=w;
+        }
+    }
+    
+    void show () {
+		if(root == NULL) return;
+        showr(root);
+        cout << endl;
+    }
+    void showr (treeitem *node) {
+        cout << node->value << " ";
+        if(node->l != NULL) {
+            cout << node->value << "L"; 
+            showr(node->l);
+        }
+        if(node->r != NULL) {
+            cout << node->value << "R";
+            showr(node->r);
+        }
+    }
+    treeitem *search (int x) {
+        treeitem *w;
+        w=root;
+        while(w != NULL && w->value != x) {
+            if(x > w->value) w=w->r;
+            else w=w->l;
+        }
+        if(w == NULL) {
+            //cout << "Net takoqo elementa" << endl;
+            return NULL;
+        }
+        return w;
+    }
+	treeitem* f1(treeitem *root,treeitem *t) {
+		treeitem *w;
+		w = t->l;
+			while(w->r != NULL) {
+				w = w->r;
+			} 
+			if(w->l) w->l->f=w->f;
+			if(!w->f){root=w->l; delete t; return NULL;}
+			else {
+				if(w->f->l == w) w->f->l=w->l;
+				else if (w->f->r == w) w->f->r=w->l;
+			}
+			return w;
+	}
+	treeitem * f2(treeitem *root,treeitem *t) {
+		treeitem *w;
+		w = t->r;
+			while(w->l != NULL) {
+				w=w->l;
+			}
+			if(w->r) w->r->f = w->f;
+			if(!w->f) {root=w->r; delete t; return NULL;}
+			else {
+				if(w->f->l == w) w->f->l=w->r;
+				else if (w->f->r == w) w->f->r=w->r;
+			}
+			return w;
+	}
+	void del(int x) {
+		treeitem *t, *w;
+		t=search(x);
+		if (t==NULL) {
+			cout << "Net elementa" << endl; 
+			return;
+		}
+		if(t->l == NULL && t->r == NULL) {
+			if(t->f != NULL) {
+				if(t->f->l == t){t->f->l = NULL;}
+				if(t->f->r == t) t->f->r = NULL;
+			}
+			if(t==root) {
+				delete t;
+				root = NULL;
+			}
+			t=NULL;
+			delete t;
+			show();
+			return;
+		}
+		else if(t->l == NULL || t->r == NULL) {
+			if(t->l==NULL) w=f2(root,t);
+			else w=f1(root,t);
+		}
+		else if(t->l != NULL && t->r != NULL) {w=f1(root,t);}
+		    w->f = t->f;
+			if(t!=root)
+			{if(t->f->l == t) t->f->l = w;
+			else t->f->r = w;}
+			else root = w;
+			w->l = t->l;
+			w->r = t->r;
+			t=NULL;
+			delete t;
+	}
+};
+
+
+int main () {
+    tree a;
+    //a.add(1);
+    cout << "*** Do pervoqo udaleniya ***\n" << endl; 
+    a.show();
+    //a.del(1);
+    a.add(8);
+    a.show();
+    a.add(6);
+    a.show();
+    a.add(7);
+    a.show();
+    a.add(4);
+    a.show();
+    a.add(3);
+    a.show();
+    a.add(5);
+    a.show();
+    a.add(2);
+    a.show();
+    cout<<endl<<endl;
+    a.del(8);
+    a.show();
+   // a.show();
+  //  cout << "\n\n*** Posle udaleniya i dobovleniya elementov ***\n" << endl;
+   // a.show();
+   // a.del(4);
+  //  cout << "\n\n*** Posle vtoroqo udaleniya ***\n" << endl;
+   // a.show();
+   // a.del(2);
+ //   cout << "\n\n*** Posle tret'eqo udaleniya ***\n" << endl;
+   // a.show();
+    /*a.add(10);
+    a.del(10);
+    a.add(19);
+    a.add(16);
+    a.add(14);
+    a.add(18);
+    a.add(15);
+    a.add(17);
+    a.show();
+    a.del(10);
+    a.show();*/
+    return 0;
+}
diff --git a/Deque.cpp b/Deque.cpp
new file mode 100644
index 0000000..05ade53
--- /dev/null
+++ b/Deque.cpp
@@ -0,0 +1,148 @@
+#include <iostream>
+#include <cstdlib>
+using namespace std;
+
+class Deque {
+	private:
+	int size,maxsize,l,r;
+	int *a;
+	public:
+	Deque(int s) {
+		maxsize=s;
+		r=0;
+		l=s-1;
+		size=0;
+		a=new int[s];
+	}
+	friend ostream &operator << (ostream &stream , Deque y);
+	friend int operator + (int z, Deque &y);
+	void add_l (int x) {
+		if(size==maxsize) return;
+		a[l]=x;
+		l=(maxsize+l-1)%maxsize;
+		size++;
+	}
+	void add_r (int x) {
+		if(size==maxsize) return;
+		a[r]=x;
+		r=(r+1)%maxsize;
+		size++;
+	}
+	void show () {
+		int i,k;
+		if(size == 0) cout << "Pustoy deq" << endl;
+		for(i=(l+1)%maxsize,k=0;k<size;i=(i+1)%maxsize,k++) {
+			cout << a[i] << " " ;
+		}
+		cout << endl;
+	}
+	void del_l () {
+		if(size > 0) {
+			l=(l+1)%maxsize;
+			a[l]=0;
+			size--;
+		}
+		else return;
+	}
+	void del_r () {
+		if(size > 0) {
+			r=(maxsize + r - 1)%maxsize;
+			a[r]=0;
+			size--;
+		}
+		else return;
+	}
+	Deque &operator=(Deque &y) {
+		delete a;
+		a = new int [y.maxsize];
+		maxsize = y.maxsize;
+		size = y.size;
+		l = y.l;
+		r = y.r;
+		for(int i=(l+1)%maxsize,k=0;k<size ;k++, i=(i+1)%maxsize) {
+			a[i]=y.a[i];
+			
+		} 
+		//cout << y.l << endl << y.r << endl;
+		return *this;
+	}
+	Deque operator+(Deque &y) {
+		int min;
+		Deque *nd;
+		nd = new Deque(maxsize + y.maxsize);
+		if(size <= y.size) min = size;
+		else min = y.size;
+		for(int i=0;i<min;i++) {
+			nd->add_r(a[i]);
+			nd->add_r(y.a[i]);
+		}
+		if (min == size) {
+			for(int i=min;i<y.size;i++) nd->add_r(y.a[i]);
+		}
+		else for(int i=min;i<size;i++) nd->add_r(a[i]);
+		
+		return *nd;
+	}
+				// Deuqe + number
+	Deque operator + (int z) {
+		Deque na(maxsize);
+		na.size = size;
+		na.l=l;
+		na.r=r;
+		for (int i=(l+1)%maxsize,k=0;k<size;k++,i=(i+1)%maxsize) {
+			na.a[i] = a[i] + z;
+		}
+		return na;
+	}
+
+};
+	ostream &operator << (ostream &stream , Deque y) {
+		int i,k;
+		if(y.size == 0) cout << "Pustoy deq" << endl;
+		for(i=(y.l+1)%y.maxsize,k=0;k<y.size;i=(i+1)%y.maxsize,k++) {
+			cout << y.a[i] << " " ;
+		}
+		cout << endl;
+		return stream;
+	}
+				//number + Deque
+	int operator + (int z, Deque &y) {
+		int sum=z;
+		for (int i=(y.l+1)%y.maxsize,k=0;k<y.size;k++,i=(i+1)%y.maxsize) {
+			if(k%2==0) sum += y.a[i];
+			else sum -= y.a[i];
+		}
+		return sum;
+	}
+
+int main () {
+	Deque a(10);
+	int i;
+	/*for(int i=0;i<5;i++) {
+		a.add_l(rand()%30);
+		a.add_r(rand()%30);
+	}*/
+	for(i=1;i<8;i++) {
+		a.add_r(i);
+	}
+	Deque b(4);
+	for(i=8;i<12;i++) {
+		b.add_r(i);
+	}
+	Deque c=a+b;
+	//c.show();
+	b=c;
+	//b.show();
+	Deque d=a+4;
+	cout << "       a+4" << endl;
+	cout << "a  =" << a ;
+	cout << "a+4=" << d << endl;
+	//cout << b << endl;
+	int k;
+	
+	k = 4 + a;
+	cout << "       4+a" << endl;
+	cout << "a  =" << a ;
+	cout << "4+a=" << k << endl;
+	return 0;
+ }
diff --git a/Stack.cpp b/Stack.cpp
new file mode 100644
index 0000000..750bbb2
--- /dev/null
+++ b/Stack.cpp
@@ -0,0 +1,74 @@
+#include <iostream>
+
+using namespace std;
+
+class Stack {
+	private:
+	int size, l;
+	int *a;
+	public:
+	Stack (int s) {
+		size = s;
+		l=0;
+		a = new int[size];
+	}
+	int add(int el) {
+		if (l >= size) return -1;
+			a[l]=el;
+			l++;
+		return 0;
+	}
+	void show() {
+		for (int i=0; i<size; i++) {
+			if(i == l) cout << "<" << a[i] << ">";
+			cout << a[i] << " ";
+		}
+		cout << endl;
+	}
+	void del() {
+		if (l <= 0) return ;
+		l--;
+		a[l]=0;
+	}
+	Stack sum (Stack b) {
+		int min;
+		Stack t(l+b.l);
+		if (l <= b.l) min = l;
+		else min = b.l;
+		for( int i=0; i<min; i++) {
+			t.add(a[i]);
+			t.add(b.a[i]);
+		}
+		if(min == l) {
+			for(int i=min; i<b.l; i++) t.add(b.a[i]);
+		}
+		else for( int i=min; i<l; i++) t.add(a[i]);
+		return t;
+	}
+};
+int main() {
+	int add;
+	Stack a(10);
+	Stack b(15);
+	for (int i=0; i<10; i++) {
+		add=a.add(i);
+	}
+	a.show();
+	a.del();
+	a.del();
+	a.del();
+	a.show();
+	Stack d(5);
+	for (int i=1; i<6; i++) {
+		add=d.add(i);
+	}
+	Stack e(9);
+	for (int i=6; i<15; i++) {
+		add=e.add(i);
+		cout << add << endl;
+	}
+	Stack c=d.sum(e);
+	c.show();
+	return 0;
+}
+
diff --git a/biliard.cpp b/biliard.cpp
new file mode 100644
index 0000000..2e0f006
--- /dev/null
+++ b/biliard.cpp
@@ -0,0 +1,71 @@
+#include <iostream>
+
+using namespace std;
+
+class Stack {
+	private:
+	int size, l;
+	int *a;
+	public:
+	Stack (int s) {
+		size = s;
+		l=0;
+		a = new int[size];
+	}
+	int add(int el) {
+		if (l >= size) return -1;
+			a[l]=el;
+			l++;
+		return 0;
+	}
+	int del() {
+		int b;
+		if (l <= 0) return 0;
+		l--;
+		b = a[l];
+		a[l]=0;
+		return b;
+	}
+};
+
+void proverka(int * b, int n) {
+	int i=1;
+	for(i=i;b[i] > b[i-1] && i<=n;i++);
+	i++;
+	for(i=i;b[i] < b[i-1] && i<=n;i++); 
+	if(i < n){ 
+		cout << "Ne po poryadku zabiti wari" << endl;
+		return;
+	}
+	cout << "wari zabiti v pravilnom poryadke" << endl;
+}
+
+int main () {
+	int n,i=0,*b,k,t,j;
+	cout << "Skolko warov" << endl;
+	cin >> n;
+	b = new int[n];
+	Stack a(n);
+	for(j=n;j>0;j--) {
+		cout << "Kakoy war zakatit?" << endl;
+		cin >> k;
+		a.add(k);
+		cout << "Pomownik vitawil?" << endl;
+		cin >> t;
+		if(t != 0) { 
+			k = a.del(); 
+			b[i] = k; 
+			i++;
+		}
+	}
+	for(k = a.del();k!=0;k = a.del()) {
+		b[i] = k;
+		i++;
+	}
+	for(i=0;i<n;i++) {
+		cout << b[i] << " ";
+	}
+	cout << endl;
+	proverka(b,n);
+	return 0;
+}
diff --git a/hashprob.cpp b/hashprob.cpp
new file mode 100644
index 0000000..63cd34a
--- /dev/null
+++ b/hashprob.cpp
@@ -0,0 +1,91 @@
+#include <iostream> 
+
+using namespace std;
+
+void hashadd (int *a,int n,int x) {
+	int k,kol=0;
+	k = x%n;
+	cout << endl << "x = " << x << endl;
+	while(a[k] != 0) {
+		k=(k+1)%n;
+		kol++;
+		if (k == x%n) {
+			cout << "Polniy massiv" << endl;
+			kol=0;
+			return;
+		}
+	}
+	cout << "Kolizii= " << kol << endl;
+	a[k]=x;
+	for(int i=0; i<n; i++) {
+			cout << a[i] << " " ;
+	}
+	cout << endl;
+}
+
+
+void hashdel (int *a,int n,int x) {
+	int j,i,k,kol=0,l,p,q,m;
+	k=x%n;
+	i=k;
+	cout << endl << "x = " << x << endl;
+	while (a[i] != x) {
+		i = (i+1)%n;
+		kol++;
+		if(i == x%n) {
+			cout << "Net elementa" << endl;
+			kol=0;
+			return;
+		} 
+	}
+	//cout << "Kolizii poiska = " << kol << endl;
+	a[i]=0;
+	l=(i+1)%n;
+	j=i;
+	while (a[l] != 0 && l != j) {
+		p=a[l]%n;
+		q=i-p;
+		m=l-p;
+		if(m!=0) {
+			if(m<0) m+=n;
+			if(q<0) q+=n;
+			if(m>q) {
+				a[i]=a[l];
+				a[l]=0;
+				i=l;
+			}
+		}
+		l=(l+1)%n;
+		kol++;
+	}
+	cout << "Kolizii udaleniya+poiska = " << kol << endl;
+	for(i=0;i<n;i++) {
+		cout << a[i] << " ";
+	}
+	cout << endl;
+}
+
+
+int main() {
+	int *a,n;
+	cin >> n;
+	a = new int [n];
+	for (int i=0;i<n;i++) {
+		a[i]=0;
+	}
+	hashadd(a,n,72);
+	hashadd(a,n,69);
+	hashadd(a,n,22);
+	hashadd(a,n,4);
+	hashadd(a,n,59);
+	hashadd(a,n,31);
+	hashadd(a,n,15);
+	hashadd(a,n,39);
+	hashadd(a,n,6);
+	hashadd(a,n,11);
+	cout << "\n*** Udaleniye ***\n";
+	hashdel(a,n,11);
+	hashdel(a,n,69);
+	hashdel(a,n,22);
+	cout << "\n\n *** D O N E *** \n" << endl;
+}
diff --git a/piramid2.c b/piramid2.c
new file mode 100644
index 0000000..24346ae
--- /dev/null
+++ b/piramid2.c
@@ -0,0 +1,86 @@
+#include <stdio.h>
+#include <stdlib.h>
+void piramid (int *a,int n) {
+	int i,r,l,tmp,pmt,b;
+	for(i=(n-2)/2;i>=0;i--) {
+		b=i;
+		while (b<n) {
+			l=2*b+1;
+			r=l+1;
+			if(l>=n) break;
+			if(r<n && a[r]>a[l]) l=r;
+			if(a[l]>a[b]) {
+				tmp=a[l];
+				a[l]=a[b];
+				a[b]=tmp;
+				b=l;
+			}
+			else break;
+		}
+	}
+	while(n>1) {
+		tmp=a[0];
+		a[0]=a[n-1];
+		a[n-1]=tmp;
+		n--;
+		b=0;
+		while(b<n) {
+			l=2*b+1;
+			r=l+1;
+			if(l>=n) break;
+			if(r<n && a[r]>a[l]) l=r;
+			if(a[l]>a[b]) {
+				pmt=a[b];
+				a[b]=a[l];
+				a[l]=pmt;
+				b=l;
+			}
+			else break;
+		}
+	}
+}
+
+
+
+
+int main() {
+	
+	int *a,n,i;
+	scanf("%d", &n);
+	a=(int*)malloc(n*sizeof(int));
+	for(i=0; i<n; i++)
+	{
+		a[i]=rand()%20;
+	}
+	for(i=0; i<n; i++)
+	{
+		printf("%d ", a[i]);
+	}
+	printf("\n\n");
+	piramid(a,n);
+	for(i=0; i<n; i++)
+	{
+		printf("%d ", a[i]);
+	}
+	printf("\n\n");
+	return 0;
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+