Avl Tree

//NAME: MANGUERRA JR, WILLIAM E.
//INSTRUCTOR: RUBY GLIPONEO
//YEAR AND SECTION: II-CpE 1
# include
# include
# include

using namespace std; struct node
{
int element; node *left; node *right; int height;
};
typedef struct node *nodeptr;

class avltree
{
public: void insert(int,nodeptr &); void del(int, nodeptr &); int deletemin(nodeptr &); void find(int,nodeptr &); nodeptr findmin(nodeptr); nodeptr findmax(nodeptr); void preorder(nodeptr); void inorder(nodeptr); void postorder(nodeptr); int bsheight(nodeptr); nodeptr srl(nodeptr &); nodeptr drl(nodeptr &); nodeptr srr(nodeptr &); nodeptr drr(nodeptr &); int max(int,int); int nonodes(nodeptr);
};
int main(int argc, char *argv[])
{

nodeptr root,root1,min,max; int a,choice,f,d,flag; char ch='y'; avltree bst; root = NULL; root1=NULL; do
{

coutright != NULL) { if(parent->left == curr) { parent->left = curr->right; delete curr; } else { parent->right = curr->right; delete curr; } } else // left child present, no right child { if(parent->left == curr) { parent->left = curr->left; delete curr; } else { parent->right = curr->left; delete curr; } } return; }

//We're looking at a leaf node if( curr->left == NULL && curr->right == NULL) { if(parent->left == curr) parent->left = NULL; else parent->right = NULL; delete curr; return; }

//Node with 2 children // replace node with smallest value in right subtree if (curr->left != NULL && curr->right != NULL) { tree_node* chkr; chkr = curr->right; if((chkr->left == NULL) && (chkr->right == NULL)) { curr =