Question: Write a C program to create a binary tree as shown in bellow, with the following elements: 50, 17, 72, 12, 23, 54, 76, 9, 14, 25 and 67. After creating the tree, perform an in-order traversal to display the elements. Answer: #include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node* left; struct Node* right; }; struct Node* createNode(int value) { struct Node* newNode = (struct Node*)malloc(sizeof(struct Node)); newNode -> data = value; newNode -> left = NULL; newNode -> right = NULL; return newNode; } void inOrderTraversal(struct Node* root) { if(root!=NULL) { inOrderTraversal(root -> left); printf("%d ", root -> data); inOrderTraversal(root -> right); } } int main() { struct Node* root = createNode(50); root -> left = createNode(17); root -> right = createNode(72); root -> left -> left = createNode(12); root -> left -> right = createNode(23); root -> left -> left -> left = createNode(9); root -> left -> left -> right = createNode(14); root -> left -> right -> right = createNode(25); root -> right -> left = createNode(54); root -> right -> right = createNode(76); root -> right -> left -> right = createNode(67); inOrderTraversal(root); return 0; } //OUTPUT: In-Order Traversal: 9 12 14 17 23 25 50 54 67 72 76
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter