Module 16: Advanced C, Data Structures & Top 50 Interview Questions

CC = gcc
CFLAGS = -Wall -Wextra -Werror -O2 -std=c17 -g
OBJS = main.o math_utils.o network.o

myapp: $(OBJS)
	$(CC) $(CFLAGS) -o myapp $(OBJS)

%.o: %.c
	$(CC) $(CFLAGS) -c $< -o $@

clean:
	rm -f $(OBJS) myapp

typedef struct Node {
    int val;
    struct Node *next;
} Node;

void insert_front(Node **head, int value) {
    Node *new_node = malloc(sizeof(Node));
    new_node->val = value;
    new_node->next = *head;
    *head = new_node;
}

void reverse_list(Node **head) {
    Node *prev = NULL, *curr = *head, *next = NULL;
    while (curr != NULL) {
        next = curr->next;
        curr->next = prev;
        prev = curr;
        curr = next;
    }
    *head = prev;
}

typedef struct TreeNode {
    int key;
    struct TreeNode *left;
    struct TreeNode *right;
} TreeNode;

TreeNode* insert_bst(TreeNode *root, int key) {
    if (root == NULL) {
        TreeNode *node = malloc(sizeof(TreeNode));
        node->key = key;
        node->left = node->right = NULL;
        return node;
    }
    if (key < root->key) root->left = insert_bst(root->left, key);
    else if (key > root->key) root->right = insert_bst(root->right, key);
    return root;
}