Given a binary tree. WAP to check whether it is height balanced ( i.e. all the leaves in the binary tree are of the same height )
struct node
{
int data;
struct node *lChild;
struct node *rChild;
};
struct node
{
int data;
struct node *lChild;
struct node *rChild;
};
