#include <stdio.h>

void getElement(int arr[], int size, int index) {
if(index >= 0 && index < size) {
printf("%d", arr[index]);
} else {
printf("Index out of bounds");
}
}

int main() {
int size, index;

// Read the size of the array
scanf("%d", &size);

int arr[size];

// Read array elements
for(int i = 0; i < size; i++) {
scanf("%d", &arr[i]);
}

// Read the index to access
scanf("%d", &index);

getElement(arr, size, index);

return 0;
}

This question asked about these.

I'm confused with the purpose of the structs here.Can anyone explained.This is a question regarding an implementation of the AVL trees.

struct Node {
int key;
struct Node *left;
struct Node *right;
int height;
};
Does anyone understand this part?