Write a program to implement the binary tree data structure and perform in-order traversal.
HardProblem Statement
Write a program to implement the binary tree data structure and perform in-order traversal.
Sample Input
Insert elements: 10, 5, 15, 3, 7, 12, 18
Sample Output
In-order Traversal: 3 5 7 10 12 15 18
Limits
Time: 2s · Memory: 256 MB
Code Editor
00:00
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node *left;
struct Node *right;
};
struct Node *insert(struct Node *node, int data);
void inorder(struct Node *root);
int main() {
struct Node *root = NULL;
// Logic to insert nodes and perform in-order traversal
return 0;
}
Input
Insert elements: 10, 5, 15, 3, 7, 12, 18
Expected Output
In-order Traversal: 3 5 7 10 12 15 18