Question

in c++ please

In this quiz, you will set the data for the nodes in a given binary tree in such a way that the binary tree satisfies the data-related property of a binary search tree and at the same time the structure of the binary tree is preserved. You are given the code for constructing a binary tree whose structure information is passed through a text file and the number of nodes is input by the user. You also input the maximum data value for a node (the data for the nodes could range anywhere from 1 to the maximum data value input by the user). The main function is already written for you. You could notice in the main function that after the binary tree is constructed based on the text file input, a random array of integers in the range of 1 to the maximum data value) is generated and is sorted using the selection sort algorithm. The sorted array is passed as the argument for the PrintInorderTraversal(...) function, which in turn calls the recursive InOrder Traversal(...) function whose arguments are the node id to be traversed and the sorted data array, as shown in the code provided. As part of the Inorder traversal, you will set the data for the visited node using the sorted data array as well as print the same. You need to keep track of the order in which the nodes are visited using a global variable whose value can be set/altered in any of the functions in your program. As a clue for where all you would need to add/extend the code, I have placed the comments // Extend the code here as needed or // Extend the code for this function here as needed at a total of three locations in the entire code. You just need to add appropriate statement(s) at each of these locations to accomplish what is needed. After setting the data for the nodes in the binary tree using the in order traversal process, the main function will print the data for the nodes in the binary tree. As part of your report, you will draw the binary tree corresponding to the given text file. Clearly indicate the node ids outside the circles for the nodes. Then, using the output of your code, fill up the circles of the nodes of the binary tree with the data printed for the nodes. You could cross-check the correctness of your code by checking whether the binary tree with the data satisfies the property for a binary search tree.

program for this code

#include <iostream>

#include <fstream>

#include <string>

#include <cstring> // for string tokenizer and c-style string processing

#include <algorithm> // max function

#include <stdlib.h>

#include <time.h>

using namespace std;

// Extend the code here as needed

class BTNode{

private:

int nodeid;

int data;

int levelNum;

BTNode* leftChildPtr;

BTNode* rightChildPtr;

public:

BTNode(){}

void setNodeId(int id){

nodeid = id;

}

int getNodeId(){

return nodeid;

}

void setData(int d){

data = d;

}

int getData(){

return data;

}

void setLevelNum(int level){

levelNum = level;

}

int getLevelNum(){

return levelNum;

}

void setLeftChildPtr(BTNode* ptr){

leftChildPtr = ptr;

}

void setRightChildPtr(BTNode* ptr){

rightChildPtr = ptr;

}

BTNode* getLeftChildPtr(){

return leftChildPtr;

}

BTNode* getRightChildPtr(){

return rightChildPtr;

}

int getLeftChildID(){

if (leftChildPtr == 0)

return -1;

return leftChildPtr->getNodeId();

}

int getRightChildID(){

if (rightChildPtr == 0)

return -1;

return rightChildPtr->getNodeId();

}

};

class BinaryTree{

private:

int numNodes;

BTNode* arrayOfBTNodes;

public:

BinaryTree(int n){

numNodes = n;

arrayOfBTNodes = new BTNode[numNodes];

for (int id = 0; id < numNodes; id++){

arrayOfBTNodes[id].setNodeId(id);

arrayOfBTNodes[id].setLevelNum(-1);

arrayOfBTNodes[id].setLeftChildPtr(0);

arrayOfBTNodes[id].setRightChildPtr(0);

}

}

void setLeftLink(int upstreamNodeID, int downstreamNodeID){

arrayOfBTNodes[upstreamNodeID].setLeftChildPtr(&arrayOfBTNodes[downstreamNodeID]);

}

void setRightLink(int upstreamNodeID, int downstreamNodeID){

arrayOfBTNodes[upstreamNodeID].setRightChildPtr(&arrayOfBTNodes[downstreamNodeID]);

}

void printLeafNodes(){

for (int id = 0; id < numNodes; id++){

if (arrayOfBTNodes[id].getLeftChildPtr() == 0 && arrayOfBTNodes[id].getRightChildPtr() == 0)

cout << id << " ";

}

cout << endl;

}

bool isLeafNode(int nodeid){

if (arrayOfBTNodes[nodeid].getLeftChildPtr() == 0 && arrayOfBTNodes[nodeid].getRightChildPtr() == 0)

return true;

return false;

}

void PrintNodeData(){

for (int nodeid = 0; nodeid < numNodes; nodeid++)

cout << nodeid << " " << arrayOfBTNodes[nodeid].getData() << endl;

}

void InOrderTraversal(int nodeid, int *dataArray){

if (nodeid == -1)

return;

InOrderTraversal(arrayOfBTNodes[nodeid].getLeftChildID(), dataArray);

// Extend the code for this function here as needed

cout << arrayOfBTNodes[nodeid].getData() << " ";

InOrderTraversal(arrayOfBTNodes[nodeid].getRightChildID(), dataArray);

}

void PrintInOrderTraversal(int *dataArray){

// Extend the code for this function here as needed

InOrderTraversal(0, dataArray);

cout << endl;

}

};

void SelectionSort(int *array, int arraySize){

for (int iterationNum = 0; iterationNum < arraySize-1; iterationNum++){

int minIndex = iterationNum;

for (int j = iterationNum+1; j < arraySize; j++){

if (array[j] < array[minIndex])

minIndex = j;

}

// swap array[minIndex] with array[iterationNum]

int temp = array[minIndex];

array[minIndex] = array[iterationNum];

array[iterationNum] = temp;

}

}

int main(){

string filename;

cout << "Enter a file name: ";

cin >> filename;

int numNodes;

cout << "Enter number of nodes: ";

cin >> numNodes;

BinaryTree binaryTree(numNodes);

ifstream fileReader(filename);

if (!fileReader){

cout << "File cannot be opened!! ";

return 0;

}

int numCharsPerLine = 10;

char *line = new char[numCharsPerLine];

// '10' is the maximum number of characters per line

fileReader.getline(line, numCharsPerLine, '\n');

// '\n' is the delimiting character to stop reading the line

while (fileReader){

char* cptr = strtok(line, ",: ");

string upstreamNodeToken(cptr);

int upstreamNodeID = stoi(upstreamNodeToken);

cptr = strtok(NULL, ",: ");

int childIndex = 0; // 0 for left child; 1 for right child

while (cptr != 0){

string downstreamNodeToken(cptr);

int downstreamNodeID = stoi(downstreamNodeToken);

if (childIndex == 0 && downstreamNodeID != -1)

binaryTree.setLeftLink(upstreamNodeID, downstreamNodeID);

if (childIndex == 1 && downstreamNodeID != -1)

binaryTree.setRightLink(upstreamNodeID, downstreamNodeID);

cptr = strtok(NULL, ",: ");

childIndex++;

}

fileReader.getline(line, numCharsPerLine, '\n');

}

// Generating the data array

int *dataArray = new int[numNodes];

int maxValue;

cout << "Enter the maximum value for an element: ";

cin >> maxValue;

srand(time(NULL));

cout << "Data array generated: ";

for (int index = 0; index < numNodes; index++){

dataArray[index] = 1 + rand() % maxValue;

cout << dataArray[index] << " ";

}

cout << endl;

SelectionSort(dataArray, numNodes);

cout << "Inorder traversal: " << endl;

binaryTree.PrintInOrderTraversal(dataArray);

cout << "Node(ID) Data " << endl;

binaryTree.PrintNodeData();

system("pause");

return 0;

}

Answer 1

ANSWER

As per the given question,

#include <iostream>

#include <fstream>

#include <string>

#include <cstring> // for string tokenizer and c-style string processing

#include <algorithm> // max function

#include <stdlib.h>

#include <time.h>

using namespace std;

// Extend the code here as needed

class BTNode{

private:

int nodeid;

int data;

int levelNum;

BTNode* leftChildPtr;

BTNode* rightChildPtr;

public:

BTNode(){}

void setNodeId(int id){

nodeid = id;

}

int getNodeId(){

return nodeid;

}

void setData(int d){

data = d;

}

int getData(){

return data;

}

void setLevelNum(int level){

levelNum = level;

}

int getLevelNum(){

return levelNum;

}

void setLeftChildPtr(BTNode* ptr){

leftChildPtr = ptr;

}

void setRightChildPtr(BTNode* ptr){

rightChildPtr = ptr;

}

BTNode* getLeftChildPtr(){

return leftChildPtr;

}

BTNode* getRightChildPtr(){

return rightChildPtr;

}

int getLeftChildID(){

if (leftChildPtr == 0)

return -1;

return leftChildPtr->getNodeId();

}

int getRightChildID(){

if (rightChildPtr == 0)

return -1;

return rightChildPtr->getNodeId();

}

};

class BinaryTree{

private:

int numNodes;

BTNode* arrayOfBTNodes;

int rootNodeID;

public:

BinaryTree(int n){

numNodes = n;

arrayOfBTNodes = new BTNode[numNodes];

for (int id = 0; id < numNodes; id++){

arrayOfBTNodes[id].setNodeId(id);

arrayOfBTNodes[id].setLevelNum(-1);

arrayOfBTNodes[id].setLeftChildPtr(0);

arrayOfBTNodes[id].setRightChildPtr(0);

}

}

void setLeftLink(int upstreamNodeID, int downstreamNodeID){

arrayOfBTNodes[upstreamNodeID].setLeftChildPtr(&arrayOfBTNodes[downstreamNodeID]);

}

void setRightLink(int upstreamNodeID, int downstreamNodeID){

arrayOfBTNodes[upstreamNodeID].setRightChildPtr(&arrayOfBTNodes[downstreamNodeID]);

}

void printLeafNodes(){

for (int id = 0; id < numNodes; id++){

if (arrayOfBTNodes[id].getLeftChildPtr() == 0 && arrayOfBTNodes[id].getRightChildPtr() == 0)

cout << id << " ";

}

cout << endl;

}

bool isLeafNode(int nodeid){

if (arrayOfBTNodes[nodeid].getLeftChildPtr() == 0 && arrayOfBTNodes[nodeid].getRightChildPtr() == 0)

return true;

return false;

}

void PrintNodeData(){

for (int nodeid = 0; nodeid < numNodes; nodeid++)

cout << nodeid << " " << arrayOfBTNodes[nodeid].getData() << endl;

}

void InOrderTraversal(int nodeid, int *dataArray){

if (nodeid == -1)

return;

InOrderTraversal(arrayOfBTNodes[nodeid].getLeftChildID(), dataArray);

cout << arrayOfBTNodes[nodeid].getData() << " ";

InOrderTraversal(arrayOfBTNodes[nodeid].getRightChildID(), dataArray);

}

void constructBSTree(int *array){

int leftIndex = 0;

int rightIndex = numNodes-1;

int middleIndex = (leftIndex + rightIndex)/2;

rootNodeID = middleIndex;

arrayOfBTNodes[middleIndex].setData(array[middleIndex]);

ChainNodes(array, middleIndex, leftIndex, rightIndex);

}

void ChainNodes(int* array, int middleIndex, int leftIndex, int rightIndex){

if (leftIndex < middleIndex){

int rootIDLeftSubtree = (leftIndex + middleIndex-1)/2;

setLeftLink(middleIndex, rootIDLeftSubtree);

arrayOfBTNodes[rootIDLeftSubtree].setData(array[rootIDLeftSubtree]);

ChainNodes(array, rootIDLeftSubtree, leftIndex, middleIndex-1);

}

if (rightIndex > middleIndex){

int rootIDRightSubtree = (rightIndex + middleIndex + 1)/2;

setRightLink(middleIndex, rootIDRightSubtree);

arrayOfBTNodes[rootIDRightSubtree].setData(array[rootIDRightSubtree]);

ChainNodes(array, rootIDRightSubtree, middleIndex+1, rightIndex);

}

}

void PrintInOrderTraversal(int *dataArray){

// Extend the code for this function here as needed

constructBSTree(dataArray);

InOrderTraversal(rootNodeID, dataArray);

cout << endl;

}

};

void SelectionSort(int *array, int arraySize){

for (int iterationNum = 0; iterationNum < arraySize-1; iterationNum++){

int minIndex = iterationNum;

for (int j = iterationNum+1; j < arraySize; j++){

if (array[j] < array[minIndex])

minIndex = j;

}

// swap array[minIndex] with array[iterationNum]

int temp = array[minIndex];

array[minIndex] = array[iterationNum];

array[iterationNum] = temp;

}

}

int main(){

string filename;

cout << "Enter a file name: ";

cin >> filename;

int numNodes;

cout << "Enter number of nodes: ";

cin >> numNodes;

BinaryTree binaryTree(numNodes);

ifstream fileReader(filename);

if (!fileReader){

cout << "File cannot be opened!! ";

return 0;

}

int numCharsPerLine = 10;

char *line = new char[numCharsPerLine];

// '10' is the maximum number of characters per line

fileReader.getline(line, numCharsPerLine, '\n');

// '\n' is the delimiting character to stop reading the line

while (fileReader){

char* cptr = strtok(line, ",: ");

string upstreamNodeToken(cptr);

int upstreamNodeID = stoi(upstreamNodeToken);

cptr = strtok(NULL, ",: ");

int childIndex = 0; // 0 for left child; 1 for right child

while (cptr != 0){

string downstreamNodeToken(cptr);

int downstreamNodeID = stoi(downstreamNodeToken);

if (childIndex == 0 && downstreamNodeID != -1)

binaryTree.setLeftLink(upstreamNodeID, downstreamNodeID);

if (childIndex == 1 && downstreamNodeID != -1)

binaryTree.setRightLink(upstreamNodeID, downstreamNodeID);

cptr = strtok(NULL, ",: ");

childIndex++;

}

fileReader.getline(line, numCharsPerLine, '\n');

}

// Generating the data array

int *dataArray = new int[numNodes];

int maxValue;

cout << "Enter the maximum value for an element: ";

cin >> maxValue;

srand(time(NULL));

cout << "Data array generated: ";

for (int index = 0; index < numNodes; index++){

dataArray[index] = 1 + rand() % maxValue;

cout << dataArray[index] << " ";

}

cout << endl;

SelectionSort(dataArray, numNodes);

cout << "Inorder traversal: " << endl;

binaryTree.PrintInOrderTraversal(dataArray);

cout << "Node(ID) Data " << endl;

binaryTree.PrintNodeData();

system("pause");

return 0;

}

===============================================

SEE OUTPUT

Files - https://SpectacularSvelteFact.rahulkumar29.repl.ru LU main.cpp input.txt 206 208 main.cpp B saved 11 11 13 LIIC UCLL LITIGL LCI LU stop Couny CHIC Line 204 while (fileReader) { 205 char* cptr = strtok(line, ",: "); string upstreamNodeToken(cptr); 207 int upstreamNodeID = stoi(upstreamNode Token); cptr = strtok(NULL, ",: "); 209 int childIndex = 0; // for left child; 1 for right child 210 while (cptr != 0){ string downstreamNodeToken(cptr); 212 int downstreamNodeID = stoi(downstreamNodeToken); 213 if (childIndex == 0 && downstreamNodeID != -1) 214 binaryTree. setLeftLink(upstreamNodeID, downstreamNodeID); 215 if (childIndex == 1 && downstreamNodeID != -1) binaryTree. setRightLink(upstreamNodeID, downstreamNodeID); cptr = strtok (NULL, ",: "); 218 childIndex++; 219 220 fileReader.getline(line, numCharsPerLine, '\n'); 221 } 222 223 1/ Generating the data array 224 int *dataArray = new int[numNodes); 225 int maxValue; 226 cout << "Enter the maximum value for an element: "; 227 rin mayValue. clang version 7.0.0-3-ubuntu0.18.94.1 (tags/RTLEAST E_700/final) > clang++-7 -pthread -o main main.cpp 3./main Enter a file name: input.txt Enter number of nodes: 10 Enter the maximum value for an element: 100 Data array generated: 98 70 18 7 5 12 94 63 91 46 Inorder traversal: 5 7 12 18 46 63 70 91 94 98 Node (ID) Data 05 17 211 216 217 vou AWN 8 94 9 98 sh: 1: pause: not found

PLEASE COMMENT if there is any concern.

=========================================

Thank you for the question....kindly rate ...it helps me a lot