Question

(C++ please, 10000Ints.text file will be in a comment below, it won't let me post in description because it is too long.)

30 Points
20	Read Data From File and achieve outcome
5	Connect to Text File
5	Coding Conventions / Readability of code

Read data into program from text file 10000Ints.text below.

Fill a Binary Search Tree with the values from the sample text file included.

Have your program read the information from the text file. Do not copy and paste data into the program.

You can use an IDE or execute in the terminal

Answer 1

How are the value in file ? I have assumed its separated by space Like 10 3 4 5 6 7

#include<iostream>

#include<fstream>

#include <stdlib.h> //srand, rand

#include <time.h>//clock_t, clock, CLOCKS_PER_SEC

#include<iomanip>

using namespace std;

struct node {

int data;

struct node* left;

struct node* right;

};

struct node* newNode(int data) {

struct node* node = new(struct node); // "new" is like "malloc"

node->data = data;

node->left = NULL;

node->right = NULL;

return(node);

}

struct node* insert(struct node* node, int data) {

// 1. If the tree is empty, return a new, single node

if (node == NULL) {

return(newNode(data));

}

else {

// 2. Otherwise, recur down the tree

if (data <= node->data) node->left = insert(node->left, data);

else node->right = insert(node->right, data);

return(node); // return the (unchanged) node pointer

}

}

/*

Given a binary tree, return true if a node

with the target data is found in the tree. Recurs

down the tree, chooses the left or right

branch by comparing the target to each node.

*/

static int lookup(struct node* node, int target) {

// 1. Base case == empty tree

// in that case, the target is not found so return false

if (node == NULL) {

return(false);

}

else {

// 2. see if found here

if (target == node->data) return(true);

else {

// 3. otherwise recur down the correct subtree

if (target < node->data) return(lookup(node->left, target));

else return(lookup(node->right, target));

}

}

}

void inOrder(struct node *root){

if(root!=NULL){

inOrder(root->left);

cout << root->data<<" ";

inOrder(root->right);

}

}

int main() {

struct node *root= NULL;

char val[10];

ifstream fin; //File reader

clock_t start, end;

fin.open("10000Ints.txt");

if (!fin) {

cerr << "Not able to open 10000Ints.txt file" << endl;

return 1;

}

while(fin >> val){

root = insert(root, atoi(val));

}

cout<<"InOrder Traversal of BST is : "<<endl;

inOrder(root);

cout<<endl;

return 0;

}

===============================================================
See Output



Thanks, PLEASE COMMENT if there is any concern.