二叉查找树详解及C++实现(3)

#include <iostream>
#include "binaryTree.h"
#include "binaryTree.cpp"
using namespace binarytree;
using namespace std;

int main()
{
CBinaryTree<int> m_bTree;

m_bTree.insertElement(15);
m_bTree.insertElement(5);
m_bTree.insertElement(3);
m_bTree.insertElement(12);
m_bTree.insertElement(13);
m_bTree.insertElement(10);
m_bTree.insertElement(6);
m_bTree.insertElement(7);
m_bTree.insertElement(16);
m_bTree.insertElement(20);
m_bTree.insertElement(18);
m_bTree.insertElement(23);
m_bTree.deleteValue(5);

m_bTree.inorderTree(m_bTree.root);
system("pause");
return 1;
}