#include #include #include struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr; }; typedef struct treeNode TreeNode; typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value); void inOrder(TreeNodePtr treePtr); void preOrder(TreeNodePtr treePtr); void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr); } void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value; (*treePtr)->leftPtr = NULL; (*treePtr)->rightPtr = NULL; } else { printf("%d not inserted. No memory available.\n", value); } } else { if (value < (*treePtr)->data) { insertNode(&((*treePtr)->rightPtr), value); } else if (value > (*treePtr)->data) { insertNode(&((*treePtr)->rightPtr), value); } else { printf("&s", "dup"); } } } void inOrder(TreeNodePtr treePtr) { if (treePtr != NULL) { inOrder(treePtr->leftPtr); printf("%3d", treePtr->data); inOrder(treePtr->rightPtr); } } void preOrder(TreeNodePtr treePtr) { if (treePtr != NULL) { printf("%3d", treePtr->data); preOrder(treePtr->leftPtr); preOrder(treePtr->rightPtr); } } void postOrder(TreeNodePtr treePtr) { if (treePtr != NULL) { postOrder(treePtr->leftPtr); postOrder(treePtr->rightPtr); printf("%3d", treePtr->data); } } This is c programming. Please fix the error I'm not sure what's wrong.

#include #include #include struct treeNode { struct treeNode leftPtr; int data; struct treeNode rightPtr; }; typedef struct treeNode TreeNode; typedef TreeNode TreeNodePtr; void insertNode(TreeNodePtr treePtr, int value); void inOrder(TreeNodePtr treePtr); void preOrder(TreeNodePtr treePtr); void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr); } void insertNode(TreeNodePtr treePtr, int value) { if (treePtr == NULL) { treePtr = malloc(sizeof(TreeNode)); if (treePtr != NULL) { (treePtr)->data = value; (treePtr)->leftPtr = NULL; (treePtr)->rightPtr = NULL; } else { printf("%d not inserted. No memory available.\n", value); } } else { if (value < (treePtr)->data) { insertNode(&((treePtr)->rightPtr), value); } else if (value > (treePtr)->data) { insertNode(&((*treePtr)->rightPtr), value); } else { printf("&s", "dup"); } } } void inOrder(TreeNodePtr treePtr) { if (treePtr != NULL) { inOrder(treePtr->leftPtr); printf("%3d", treePtr->data); inOrder(treePtr->rightPtr); } } void preOrder(TreeNodePtr treePtr) { if (treePtr != NULL) { printf("%3d", treePtr->data); preOrder(treePtr->leftPtr); preOrder(treePtr->rightPtr); } } void postOrder(TreeNodePtr treePtr) { if (treePtr != NULL) { postOrder(treePtr->leftPtr); postOrder(treePtr->rightPtr); printf("%3d", treePtr->data); } } This is c programming. Please fix the error I'm not sure what's wrong.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

struct treeNode {
struct treeNode *leftPtr;
int data;
struct treeNode *rightPtr;
};

typedef struct treeNode TreeNode;
typedef TreeNode *TreeNodePtr;

void insertNode(TreeNodePtr *treePtr, int value);
void inOrder(TreeNodePtr treePtr);
void preOrder(TreeNodePtr treePtr);
void postOrder(TreeNodePtr treePtr);

int main(void) {
TreeNodePtr rootPtr = NULL;

srand(time(NULL));
puts("The numbers being placed in the tree are:");

for (unsigned int i = 1; i <= 10; ++i) {
int item = rand() % 15;
printf("%3d", item);
insertNode(&rootPtr, item);
}

puts("\n\nThe preOrder traversal is: ");
preOrder(rootPtr);

puts("\n\nThe inOrder traversal is: ");
inOrder(rootPtr);

puts("\n\nThe postOrder traversal is: ");
postOrder(rootPtr);
}

void insertNode(TreeNodePtr *treePtr, int value) {
if (*treePtr == NULL) {
*treePtr = malloc(sizeof(TreeNode));

if (*treePtr != NULL) {
(*treePtr)->data = value;
(*treePtr)->leftPtr = NULL;
(*treePtr)->rightPtr = NULL;
} else {
printf("%d not inserted. No memory available.\n", value);
}
} else {

if (value < (*treePtr)->data) {
insertNode(&((*treePtr)->rightPtr), value);
}

else if (value > (*treePtr)->data) {
insertNode(&((*treePtr)->rightPtr), value);
}
else {
printf("&s", "dup");
}
}
}
void inOrder(TreeNodePtr treePtr)
{
if (treePtr != NULL) {
inOrder(treePtr->leftPtr);
printf("%3d", treePtr->data);
inOrder(treePtr->rightPtr);
}
}

void preOrder(TreeNodePtr treePtr)
{
if (treePtr != NULL) {
printf("%3d", treePtr->data);
preOrder(treePtr->leftPtr);
preOrder(treePtr->rightPtr);
}
}

void postOrder(TreeNodePtr treePtr)
{
if (treePtr != NULL) {
postOrder(treePtr->leftPtr);
postOrder(treePtr->rightPtr);
printf("%3d", treePtr->data);
}
}

This is c programming. Please fix the error I'm not sure what's wrong.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.