Question

Write a C program that asks the user to think of an integer number from 1 to 20. Have the computer guess what the number is by using a binary tree to determine the next guess. You can create the binary tree “by hand” by typing in a set of malloc commands and explicitly linking the nodes. (make the tree completely, then traverse the tree)

Use a menu to provide the user with a selection to answer the results of the guesses. Do something like

(not exactly like this – write your own fun/cool menu with a border):

My guess is 5.

Is your number

a. 5

b. less than 5

c. more than 5

Please type in a, b or c: _

Answer 1

code:

#include<stdio.h>
struct tree
{
int data;
struct tree * left;
struct tree * right;
};
int print(struct tree * root)
{
if(root==NULL)return;

print(root->left);
printf("%d ",root->data);
print(root->right);

}

struct tree* root,*node;
void create_tree()
{
root=(struct tree*)malloc(sizeof(struct tree));
root->data=10;
root->left=NULL;
root->right=NULL;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=5;
node->left=NULL;
node->right=NULL;
root->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=15;
node->left=NULL;
node->right=NULL;
root->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=3;
node->left=NULL;
node->right=NULL;
root->left->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=7;
node->left=NULL;
node->right=NULL;
root->left->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=2;
node->left=NULL;
node->right=NULL;
root->left->left->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=1;
node->left=NULL;
node->right=NULL;
root->left->left->left->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=4;
node->left=NULL;
node->right=NULL;
root->left->left->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=6;
node->left=NULL;
node->right=NULL;
root->left->right->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=8;
node->left=NULL;
node->right=NULL;
root->left->right->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=9;
node->left=NULL;
node->right=NULL;
root->left->right->right->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=13;
node->left=NULL;
node->right=NULL;
root->right->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=17;
node->left=NULL;
node->right=NULL;
root->right->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=11;
node->left=NULL;
node->right=NULL;
root->right->left->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=14;
node->left=NULL;
node->right=NULL;
root->right->left->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=16;
node->left=NULL;
node->right=NULL;
root->right->right->left=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=18;
node->left=NULL;
node->right=NULL;
root->right->right->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=12;
node->left=NULL;
node->right=NULL;
root->right->left->left->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=19;
node->left=NULL;
node->right=NULL;
root->right->right->right->right=node;

node=(struct tree*)malloc(sizeof(struct tree));
node->data=20;
node->left=NULL;
node->right=NULL;
root->right->right->right->right->right=node;

}
void game()
{
printf("Please guess a number between 1-20\n");
struct tree *node;
node=root;
int found=0;
int ch;
while(node)
{
printf("\nMy guess is %d.",node->data);
printf("\nIs your number....");
printf("\t\n1:%d",node->data);
printf("\t\n2:less that %d",node->data);
printf("\t\n3:greater than %d\n",node->data);
printf("\nPlease select choice:");
scanf("%d", &ch);

switch(ch)
{
case 1:
printf("\nGreat found your number which is equal to %d",node->data);
found=1;
break;
case 2:
node=node->left;
break;
case 3:
node=node->right;
break;
default:
printf("\nwrong choice");
}
if(found)
break;

}
}
int main()
{
create_tree();
print(root);
game();
return 1;

}

Output:

1 2 345678 9 10 11 12 13 14 15 16 17 18 19 20 Please guess a number between 1-20 My guess is 10. Is your number.. .. 1:10 2:less that 10 3:greater than 10 Please select choice: y guess is 15 Is your number... . 1:15 2:less that 15 3:greater than 15 Please select choice:2 My guess is 13 Is your number... . 1:13 2:less that 13 3:greater than 13 Please select choice:3 My guess is 14. Is your number.. .. 1:14 2:less that 14 3:greater than 14 Please select choice:1 Great found your number which is equal to 14 Process returned 1 (0x1) execution time 19.124 s Press any key to continue

Dear friend,

I have added one extra function print to print the tree which may not be required in this case it is just for debug purpose. Hope this helps you.