Blog

What is the output of the following program? #include #incl…

What is the output of the following program? #include #include typedef struct Node { int value; struct Node* next; } Node; Node* Node_construct(int v) { Node* n = malloc(sizeof(Node)); n->value = v; n->next = NULL; return n; } Node* List_insert(Node* h, int v) { Node* p = Node_construct(v); p->next = h; return p; } void print_list(Node* h) { while (h != NULL) { printf(“%d “, h->value); h = h->next; } printf(“\n”); } int main() { Node* head = NULL; head = List_insert(head, 10); head = List_insert(head, 20); head = List_insert(head, 30); print_list(head); return 0; }

The following program generates a binary search tree, then r…

The following program generates a binary search tree, then removes a node from the tree, and outputs the in-order traversal sequence. What is the output of the following code? #include #include typedef struct Node { int key; struct Node *left, *right; } Node; Node* newNode(int item) { Node* temp = (Node*)malloc(sizeof(Node)); temp->key = item; temp->left = temp->right = NULL; return temp; } Node* insert(Node* root, int key) { if (root == NULL) return newNode(key); if (key < root->key) root->left = insert(root->left, key); else if (key > root->key) root->right = insert(root->right, key); return root; } Node* minValueNode(Node* node) { Node* current = node; while (current && current->left != NULL) current = current->left; return current; } Node* deleteNode(Node* root, int key) { if (root == NULL) return root; if (key < root->key) root->left = deleteNode(root->left, key); else if (key > root->key) root->right = deleteNode(root->right, key); else { // Node found if (root->left == NULL) { Node* temp = root->right; free(root); return temp; } else if (root->right == NULL) { Node* temp = root->left; free(root); return temp; } Node* temp = minValueNode(root->right); root->key = temp->key; // Copy successor’s content to this node root->right = deleteNode(root->right, temp->key); // Delete successor } return root; } void inorder(Node* root) { if (root != NULL) { inorder(root->left); printf(“%d “, root->key); inorder(root->right); } } int main() { Node* root = NULL; int values[] = {50, 30, 70, 20, 40, 60, 80}; for (int i = 0; i < 7; i++) root = insert(root, values[i]); root = deleteNode(root, 50); inorder(root); return 0; }