BSTNode.hpp
1.68 KB
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
#ifndef BSTNODE_HPP
#define BSTNODE_HPP
#include <iostream>
#include <iomanip>
/** This class template defines a node type for the BST container.
* Note that all members are public. So, the BST implementation should
* take care not to expose any BSTNode objects.
*/
template<typename Data>
class BSTNode {
public:
/** Member variables. */
BSTNode<Data>* parent;
BSTNode<Data>* left;
BSTNode<Data>* right;
const Data data; // the const Data in this node
int info; // variable used in advanced algorithms
/** Constructor. Initialize a BSTNode with the given Data item,
* no parent, and no children.
*/
BSTNode(const Data & d): data(d) {
left = right = parent = nullptr;
}
/** Return the inorder successor of this BSTNode in a BST,
* or nullptr if none.
* PRECONDITION: this BSTNode is a node in a BST.
* POSTCONDITION: the BST is unchanged.
* RETURNS: the BSTNode that is the inorder successor of this BSTNode,
* or nullptr if there is none.
*/ // TODO
BSTNode<Data>* successor() {
}
};
/** Overload operator<< to insert a BSTNode's fields in an ostream. */
template <typename Data>
std::ostream & operator<<(std::ostream& stm, const BSTNode<Data> & n) {
stm << '[';
stm << std::setw(10) << &n; // address of the BSTNode
stm << "; p:" << std::setw(10) << n.parent; // address of its parent
stm << "; l:" << std::setw(10) << n.left; // address of its left child
stm << "; r:" << std::setw(10) << n.right; // address of its right child
stm << "; i:" << std::setw(10) << n.info; // its info field
stm << "; d:" << n.data; // its data field
stm << ']';
return stm;
}
#endif // BSTNODE_HPP