/
BSTNode.h
54 lines (42 loc) · 1.16 KB
/
BSTNode.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include "Resources.h"
class BSTNode {
public:
BSTNode();
BSTNode(string &newData);
const string getData();
BSTNode *&getLeft();
BSTNode *&getRight();
private:
string data;
BSTNode *mpLeft;
BSTNode *mpRight;
};
/**NON MEMBER FUNCTIONS**/
ostream &operator<<(ostream &lhs, BSTNode &rhs);
bool &operator==(Recipe r1, Reipe r2) {
int r1ISize = sizeof(r1.getIngredients())/sizeof(*r1.getIngredients());
int r1DSize = sizeof(r1.getDirections())/sizeof(*r1.getDirections());
int r2ISize = sizeof(r2.getIngredients())/sizeof(*r2.getIngredients());
int r2DSize = sizeof(r2.getDirections())/sizeof(*r2.getDirections());
if(r1.getName() == r2.getName &&
r1.getYield() == r2.getYield() &&
r1.getnumIngretients() == r2.getnumIngredients()) {
if(r1ISize != r2ISize)
return false;
if(r1DSize != R2Size)
return false;s
for(int i = 0; i < r1ISize; i++)
if (r1.getIngredients()[i] != r2.getIngredients()[i])
return false;
for(int i = 0; i < r2DSize; i++)
if (r1.getDirections()[i] != r2.getDirections()[i])
return false;
return true;
} else {
return false;
}
}
bool searchFor(Recipe *pCurr, Recipe search) {
if(pCurr == NULL) {
}
}