-
Notifications
You must be signed in to change notification settings - Fork 0
/
function.h
76 lines (45 loc) · 1.27 KB
/
function.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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#ifndef FUNCTION_H
#define FUNCTION_H
#include<string>
class Node
{
public:
int weight;
Node *left, *right;
Node():weight(0),left(NULL),right(NULL){}
Node(int d):weight(d),left(NULL),right(NULL){}
Node(int d , Node *left_ , Node *right_){
weight = d;
left = left_;
right = right_;
}
};
class BinaryTree
{
public:
virtual Node* constructTree( std::string treeStr) = 0;
virtual void Inorder_traversal(Node *root) = 0;
virtual void Preorder_traversal(Node *root) = 0;
virtual void Postorder_traversal(Node *root) = 0;
virtual void Levelorder_traversal(Node *root) = 0;
virtual Node* deleteTree(Node *root) = 0;
virtual int TreeHeight( Node *root) = 0;
virtual int TreeWeightSum( Node *root) = 0;
virtual int MaximumPathSum( Node *root) = 0;
virtual Node* Invert(Node *root) = 0;
};
class Implement: public BinaryTree
{
public:
Node* constructTree(std::string treeStr) ;
void Inorder_traversal(Node *root);
void Preorder_traversal(Node *root) ;
void Postorder_traversal(Node *root) ;
void Levelorder_traversal(Node *root);
Node* deleteTree(Node *root) ;
int TreeHeight( Node *root) ;
int TreeWeightSum( Node *root) ;
int MaximumPathSum(Node *root);
Node* Invert(Node *root) ;
};
#endif