struct info{
char a;
int b;
char c;
int d;
};
struct info myinfo;
{
struct info *ptr = &myinfo;
unsigned int offset;
printf("Offset = %d\n",offset);
}
Tree:
An AVL tree is a binary search tree which has the following properties:
- The sub-trees of every node differ in height by at most one.
No comments:
Post a Comment