When presenting a menu option to the user in the main cpp file. Asking user to input in an ID, how do I code a search method implementation where it takes that ID and search it in the binary tree and either return true if found and false if not. I am trying to steer away from using item which is attached to both (ID, username). I am trying to only take the ID input and the node pointer and traversing through the binary tree to find if the ID matches any of the nodes. 0253 template bool BinaryTree5455565758595051525334555657 }BinaryNode *nodePtr = rootPtr;while (nodePtr) {if (nodePtr->entry.getEmployee ID() item.getEmployeeID() &&nodePtr->entry.get EmployeeName() item.get EmployeeName())return true;else if (item < nodePtr->entry)}:: searchNode(ItemType item) {elsenodePtr = nodePtr->leftChildPtr;nodePtr = nodePtr->rightChildPtr;return false;== 1 #ifndef BINARYTREE_H2 #define BINARYTREE_H3 #include "EmployeeData.h"4#include 5 using namespace std;67 template 8class Binary Tree {9 private:101112131415161718192021222324252627282930struct BinaryNode {ItemType entry;BinaryNode *leftChildPtr;BinaryNode *rightChildPtr;};BinaryNode *rootPtr;void placeNode(BinaryNode *&, BinaryNode *&);void display InOrder (BinaryNode *) const;public:Binary Tree (){rootPtr = NULL; }void insertNode (ItemType);bool searchNode (ItemType);void displayInOrder() const {display InOrder (rootPtr);}

Algorithm:Initialize a Binary Tree class with a nested BinaryNode structure.Implement methods to…

Answered: When presenting a menu option to the…

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

When presenting a menu option to the user in the main cpp file. Asking user to input in an ID, how do I code a search method implementation where it takes that ID and search it in the binary tree and either return true if found and false if not. I am trying to steer away from using item which is attached to both (ID, username). I am trying to only take the ID input and the node pointer and traversing through the binary tree to find if the ID matches any of the nodes.

02
53 template <class ItemType>
bool BinaryTree<ItemType>
54
55
56
57
58
59
50
51
52
53
34
55
56
57 }
BinaryNode *nodePtr = rootPtr;
while (nodePtr) {
if (nodePtr->entry.getEmployee ID() item.getEmployeeID() &&
nodePtr->entry.get EmployeeName() item.get EmployeeName())
return true;
else if (item < nodePtr->entry)
}
:: searchNode(ItemType item) {
else
nodePtr = nodePtr->leftChildPtr;
nodePtr = nodePtr->rightChildPtr;
return false;
==

1 #ifndef BINARYTREE_H
2 #define BINARYTREE_H
3 #include "EmployeeData.h"
4#include <iostream>
5 using namespace std;
6
7 template <class ItemType>
8
class Binary Tree {
9 private:
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
struct BinaryNode {
ItemType entry;
BinaryNode *leftChildPtr;
BinaryNode *rightChildPtr;
};
BinaryNode *rootPtr;
void placeNode(BinaryNode *&, BinaryNode *&);
void display InOrder (BinaryNode *) const;
public:
Binary Tree (){
rootPtr = NULL; }
void insertNode (ItemType);
bool searchNode (ItemType);
void displayInOrder() const {
display InOrder (rootPtr);
}

Expert Solution

Step by step

Solved in 4 steps with 5 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.

Similar questions