C++ Primer(第五版) 13.2.2节练习

13.27    引用计数版本的HasPtr：

class HasPtr {
public:
	HasPtr(const string &s = string()): 
		ps(new string(s)), i(0), use(new size_t(1)) {}
	HasPtr(const HasPtr &p):
		ps(new string(*p.ps)), i(p.i), use(p.use) { ++*use; }
	HasPtr& operator=(const HasPtr&);
	~HasPtr();

private:
	string *ps;
	int i;
	size_t *use;	
};

HasPtr&
HasPtr::operator=(const HasPtr &rhs)
{
	++*rhs.use;
	
	if ( --*use == 0 ) {
		delete ps;
		delete use;
	}
	
	ps = rhs.ps;
	i = rhs.i;
	use = rhs.use;
	
	return *this;
}

HasPtr::~HasPtr()
{
	if ( --*use == 0 ) {
		delete ps;
		delete use;
	}
}

 13.28    TreeNode代码设计：

class TreeNode {
friend class BinStrTree;
public:
	TreeNode(): value(""), count(1), left(nullptr), right(nullptr) {}
	TreeNode(string s, TreeNode *lchild = nullptr, TreeNode *rchild = nullptr):
		value(s), count(1), left(lchild), right(nullptr) { 
			cout << "construct " << endl;
			right = rchild;
	 	}
	TreeNode(const TreeNode &);
	~TreeNode();
	void print_info();
private:
	void CopyTree(void);
	int ReleaseTree(void);
	string value;
	int count;
	TreeNode *left;
	TreeNode *right;
};

void
TreeNode::CopyTree(void)
{
	cout << "copytree " << value << endl;
	if (left)
		left->CopyTree();
	if (right)
		right->CopyTree();
	++count;
}

TreeNode::TreeNode(const TreeNode &tn):
	value(tn.value), count(1), left(tn.left), right(tn.right)
{
	if (left)
		left->CopyTree();
	if (right)
		right->CopyTree();
}

int
TreeNode::ReleaseTree(void)
{
	cout << "release " << value << " " << count << endl;
	if (left) {
		if (!left->ReleaseTree())
			delete left;
	}
	if (right) {
		if (!right->ReleaseTree())
			delete right;
	}
	--count;
	
	return count;
}

TreeNode::~TreeNode()
{
	if (count)
		ReleaseTree();
}

BinStrTree代码设计（需要使用TreeNode类的一些成员）：

class BinStrTree {
public:
	BinStrTree(): root(nullptr) {}
	BinStrTree(TreeNode *t = nullptr): root(t) {}
	BinStrTree(const BinStrTree &);
	~BinStrTree();
private:
	TreeNode *root;
};

BinStrTree::BinStrTree(const BinStrTree &bst):
	root(bst.root)
{
	root->CopyTree();
}


BinStrTree::~BinStrTree()
{
	if (!root->ReleaseTree())
		delete root;
}