Node with Sons
Lesson 4 of 13 in Coddy's Binary Tree - Data Structures Series #3 course.
Challenge
EasyAdd to Node support for two children (left and right). The constructor should initialize both to null/None/etc. Add getLeft / setLeft and getRight / setRight.
Try it yourself
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "node.h"
int main() {
Node n;
Node_init(&n);
char line[256];
while (fgets(line, sizeof(line), stdin)) {
line[strcspn(line, "\r\n")] = '\0';
char* cmd = strtok(line, " \t");
if (!cmd) continue;
if (strcmp(cmd, "setValue") == 0) {
char* arg = strtok(NULL, " \t");
if (arg) Node_setValue(&n, atoi(arg));
}
if (strcmp(cmd, "getValue") == 0) {
printf("%d\n", Node_getValue(&n));
}
if (strcmp(cmd, "setLeft") == 0) {
char* arg = strtok(NULL, " \t");
Node* c = Node_new();
Node_setValue(c, atoi(arg));
Node_setLeft(&n, c);
}
if (strcmp(cmd, "getLeftValue") == 0) {
printf("%d\n", Node_getValue(Node_getLeft(&n)));
}
if (strcmp(cmd, "setRight") == 0) {
char* arg = strtok(NULL, " \t");
Node* c = Node_new();
Node_setValue(c, atoi(arg));
Node_setRight(&n, c);
}
if (strcmp(cmd, "getRightValue") == 0) {
printf("%d\n", Node_getValue(Node_getRight(&n)));
}
}
return 0;
}
All lessons in Binary Tree - Data Structures Series #3
2Binary Tree Project
Node ClassNode with Sons