#include <stdio.h> #include <stdlib.h> #define MAX 100 int tree[MAX]; // Function prototypes void insertNode(int data); void preorderTraversal(int index); void inorderTraversal(int index); void postorderTraversal(int index); void menu(); int main() { int choice, data; // Initialize the tree array with -1 indicating empty nodes for (int i = 0; i < MAX; i++) { tree[i] = -1; } while (1) { menu(); printf("Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: printf("Enter the data to insert: "); scanf("%d", &data); insertNode(data); ...