#include #include using namespace std; struct TreeNode{ TreeNode* left; TreeNode* right; int val; TreeNode(int x): val(x), left(NULL), right(NULL) {} }; int height(TreeNode* A){ if (!A) return 0; return 1+max(height(A->left), height(A->right)); } //1-preorder, 2-inorder, 3-postorder void traverse(TreeNode* A, vector &a, int i){ if (!A) return; if (i==1) a.push_back(A->val); traverse(A->left, a, i); if (i==2) a.push_back(A->val); traverse(A->right, a, i); if (i==3) a.push_back(A->val); } void level(TreeNode* A, vector> &a, int i=0){ if (!A) return; if (i>=a.size()) a.resize(i+1); a[i].push_back(A->val); level(A->left, a, i+1); level(A->right, a, i+1); } TreeNode* bst(vector &A, int start=0, int end=INT_MAX){ if (end==INT_MAX) end=A.size()-1; if (start>end) return NULL; int mid=(start+end)/2; TreeNode* t=new TreeNode(A[mid]); if (start==end) return t; t->left=bst(A,start,mid-1); t->right=bst(A,mid+1,end); return t; } void grow(TreeNode* A, int a){ TreeNode* p=NULL; bool l_r; while (A){ if (A->val>a){ l_r=1, p=A; A=A->left; } else if (A->valright; } else { cout<<"ALREADY IN THE TREE"<left=new TreeNode(a)):(p->right=new TreeNode(a)); return; } //you cannot delete the root node void del(TreeNode* A, int a){ TreeNode* p=NULL; TreeNode* t=A; bool l_r; while (t){ if (t->val>a){ p=t, l_r=1; t=t->left; } else if (t->valright; } else{ TreeNode* T; if (t->left){ T=t->left; while (T->right) T=T->right; l_r?(p->left=T):(p->right=T); T->left=t->left; return; } else if (t->right){ T=t->right; while (T->left) T=T->left; l_r?(p->left=T):(p->right=T); T->right=t->right; return; } else{ l_r?(p->left=NULL):(p->right=NULL); return; } } } cout<<"NOT FOUND"<

tree module