https://cloud.tencent.com/developer/ask/60848
主要是根据这篇文章写的二叉树的树形输出
节点数在10位以下就还好
但一往上走就后面就乱了
而且如果节点数字是十位百位甚至更高位也会乱
不知道该在哪里改了
节点一多后面就乱了
节点少的时候还好
数字位数一上去也不行了
下面是相关代码
void printTree()
{
printNode(root);
}
void printNode(pNode_t<T> node)
{
int maxlevel = maxLevel(node);
std::vector <pNode_t<T>> vectortree;
vectortree.push_back(node);
printNodeInternal(vectortree, 1, maxlevel);
// not implemented yet!
}
void printNodeInternal(std::vector<pNode_t<T>> nodes, int level, int maxLevel)
{
if (nodes.empty() || isAllElementsNull(nodes))
{
return;
}
int floor = maxLevel - level;
int endgeLines = (int)pow(2, (std::max(floor - 1, 0)));
int firstSpaces = (int)pow(2, (floor)) - 1;
int betweenSpaces = (int)pow(2, (floor + 1)) - 1;
printspaces(firstSpaces);
std::vector<pNode_t<T>> newNodes;
for(pNode_t<T> node : nodes) {
if (node != nullptr) {
std::cout << node->data;
newNodes.push_back(node->left);
newNodes.push_back(node->right);
}
else {
newNodes.push_back(nullptr);
newNodes.push_back(nullptr);
std::cout<<" ";
}
printspaces(betweenSpaces);
}
std::cout<< std::endl;
for (int i = 1; i <= endgeLines; i++) {
for (int j = 0; j < nodes.size(); j++) {
printspaces(firstSpaces - i);
if (nodes[j] == nullptr) {
printspaces(endgeLines + endgeLines + i + 1);
continue;
}
if (nodes[j]->left != nullptr)
std::cout<<"/";
else
printspaces(1);
printspaces(i + i - 1);
if (nodes[j]->right != nullptr)
std::cout<<"\\";
else
printspaces(1);
printspaces(endgeLines + endgeLines - i);
}
std::cout << std::endl;
}
printNodeInternal(newNodes, level + 1, maxLevel);
}