Scribd
Upload
65 views14 pages

Advanced Data Structures Lab

The document describes implementing various operations on an AVL Tree data structure. It includes functions to perform common operations like insertion, deletion, traversal, balancing the tree using rotations, and calculating the height. The main function contains a menu to test the various operations and display the balanced AVL tree.

Uploaded by

Jagajyothi Merneedi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
65 views14 pages

Advanced Data Structures Lab

The document describes implementing various operations on an AVL Tree data structure. It includes functions to perform common operations like insertion, deletion, traversal, balancing the tree using rotations, and calculating the height. The main function contains a menu to test the various operations and display the balanced AVL tree.

Uploaded by

Jagajyothi Merneedi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 14

ADVANCED DATA STRUCTURES LAB

Implement various operations on AVL Tree.

AIM: To Implement various operations on AVL Tree.

Description:

Program:

#include<iostream>

#include<cstdio>

#include<sstream>

#include<algorithm>

#define pow2(n) (1 << (n))

using namespace std;

/*

* Node Declaration

*/

structavl_node

int data;

structavl_node *left;

structavl_node *right;

}*root;

/*

* Class Declaration

*/

classavlTree
{

public:

int height(avl_node *);

int diff(avl_node *);

avl_node *rr_rotation(avl_node *);

avl_node *ll_rotation(avl_node *);

avl_node *lr_rotation(avl_node *);

avl_node *rl_rotation(avl_node *);

avl_node* balance(avl_node *);

avl_node* insert(avl_node *, int );

void display(avl_node *, int);

voidinorder(avl_node *);

void preorder(avl_node *);

voidpostorder(avl_node *);

avlTree()

root = NULL;

};

/*

* Main Contains Menu

*/

int main()

int choice, item;


avlTreeavl;

while (1)

cout<<"\n---------------------"<<endl;

cout<<"AVL Tree Implementation"<<endl;

cout<<"\n---------------------"<<endl;

cout<<"1.Insert Element into the tree"<<endl;

cout<<"2.Display Balanced AVL Tree"<<endl;

cout<<"3.InOrder traversal"<<endl;

cout<<"4.PreOrder traversal"<<endl;

cout<<"5.PostOrder traversal"<<endl;

cout<<"6.Exit"<<endl;

cout<<"Enter your Choice: ";

cin>>choice;

switch(choice)

case 1:

cout<<"Enter value to be inserted: ";

cin>>item;

root = avl.insert(root, item);

break;

case 2:

if (root == NULL)

cout<<"Tree is Empty"<<endl;

continue;
}

cout<<"Balanced AVL Tree:"<<endl;

avl.display(root, 1);

break;

case 3:

cout<<"Inorder Traversal:"<<endl;

avl.inorder(root);

cout<<endl;

break;

case 4:

cout<<"Preorder Traversal:"<<endl;

avl.preorder(root);

cout<<endl;

break;

case 5:

cout<<"Postorder Traversal:"<<endl;

avl.postorder(root);

cout<<endl;

break;

case 6:

exit(1);

break;

default:

cout<<"Wrong Choice"<<endl;

}
return 0;

/*

* Height of AVL Tree

*/

intavlTree::height(avl_node *temp)

int h = 0;

if (temp != NULL)

intl_height = height (temp->left);

intr_height = height (temp->right);

intmax_height = max (l_height, r_height);

h = max_height + 1;

return h;

/*

* Height Difference

*/

intavlTree::diff(avl_node *temp)

intl_height = height (temp->left);

intr_height = height (temp->right);


intb_factor= l_height - r_height;

returnb_factor;

/*

* Right- Right Rotation

*/

avl_node *avlTree::rr_rotation(avl_node *parent)

avl_node *temp;

temp = parent->right;

parent->right = temp->left;

temp->left = parent;

return temp;

/*

* Left- Left Rotation

*/

avl_node *avlTree::ll_rotation(avl_node *parent)

avl_node *temp;

temp = parent->left;

parent->left = temp->right;

temp->right = parent;

return temp;

}
/*

* Left - Right Rotation

*/

avl_node *avlTree::lr_rotation(avl_node *parent)

avl_node *temp;

temp = parent->left;

parent->left = rr_rotation (temp);

returnll_rotation (parent);

/*

* Right- Left Rotation

*/

avl_node *avlTree::rl_rotation(avl_node *parent)

avl_node *temp;

temp = parent->right;

parent->right = ll_rotation (temp);

returnrr_rotation (parent);

/*

* Balancing AVL Tree

*/
avl_node *avlTree::balance(avl_node *temp)

intbal_factor = diff (temp);

if (bal_factor> 1)

if (diff (temp->left) > 0)

temp = ll_rotation (temp);

else

temp = lr_rotation (temp);

else if (bal_factor< -1)

if (diff (temp->right) > 0)

temp = rl_rotation (temp);

else

temp = rr_rotation (temp);

return temp;

/*

* Insert Element into the tree

*/

avl_node *avlTree::insert(avl_node *root, int value)

if (root == NULL)
{

root = new avl_node;

root->data = value;

root->left = NULL;

root->right = NULL;

return root;

else if (value < root->data)

root->left = insert(root->left, value);

root = balance (root);

else if (value >= root->data)

root->right = insert(root->right, value);

root = balance (root);

return root;

/*

* Display AVL Tree

*/

voidavlTree::display(avl_node *ptr, int level)

inti;
if (ptr!=NULL)

display(ptr->right, level + 1);

printf("\n");

if (ptr == root)

cout<<"Root ->";

for (i = 0; i< level &&ptr != root; i++)

cout<<"";

cout<<ptr->data;

display(ptr->left, level + 1);

/*

* Inorder Traversal of AVL Tree

*/

voidavlTree::inorder(avl_node *tree)

if (tree == NULL)

return;

inorder (tree->left);

cout<<tree->data<<"";

inorder (tree->right);

/*

* Preorder Traversal of AVL Tree


*/

voidavlTree::preorder(avl_node *tree)

if (tree == NULL)

return;

cout<<tree->data<<"";

preorder (tree->left);

preorder (tree->right);

/*

* Postorder Traversal of AVL Tree

*/

voidavlTree::postorder(avl_node *tree)

if (tree == NULL)

return;

postorder ( tree ->left );

postorder ( tree ->right );

cout<<tree->data<<"";

Output:

You might also like