Description

Program for insertion in AVL tree...n Data Structure, an AVL tree is a self-balancing binary search tree, and it is the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; therefore, it is also said to be height-balanced.

Source Code

/*Program for insertion in AVL tree*/

#include<stdio.h>

#include<malloc.h>



typedef enum { FALSE ,TRUE } bool;

struct node

{

	int info;

	int balance;

	struct  node *lchild;

	struct  node *rchild;

... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.