我尝试编写一个函数,它将从根节点到叶节点的所有路径打印出来。
例如;
printPaths(bt1);
>2_1_
>2_3_在本例中,2是根,1-3是叶.
这里是我的简单代码,我找不到新行的位置,因为当我在任何地方编写printf("\n")时,它都会输出疯狂的输出,所以我无法在这段代码中找到问题。
void printPaths(TreeNode* root) {
if(root != NULL) {
printf("%d ", root->val);
printPaths(root->left);
printPaths(root->right);
}
}发布于 2016-05-27 13:07:02
您需要在“每条路径的尽头”处换行,因此当您到达一片叶子时:
if (root->left == NULL && root->right == NULL)
printf("\n");但是,您将无法使用代码再次打印整个路径,您需要在访问树时跟踪路径,并在到达叶子时打印路径:
void printPaths(TreeNode* root, int path[], int len)
{
if (root == NULL) // if the root is NULL, do not print anything
return;
path[len++] = root->val; // add root to your path
if (root->left == NULL && root->right == NULL) // we reached a leaf
printPath(path, len); // print the path we followed to reach this leaf
else
{
printPaths(root->left, path, len);
printPaths(root->right, path, len);
}
}
void printPath(int path[], int len)
{
for (int i = 0; i < len; i++)
printf("%d ", path[i]);
printf("\n");
}https://stackoverflow.com/questions/37483690
复制相似问题