[英]How can I eliminate tail recursion in the following function (from two recursive calls to one)?
I have the following function:我有以下功能:
void treetraverse (tnode *node)
{
if (node == NULL)
{
return;
}
fprintf(stdout,"%d",node->val);
if (node-> d == 'L')
{
treetraverse(node->r);
treetraverse(node->l);
}
else
{
treetraverse(node->l);
treetraverse(node->r);
}
}
Where d is direction which could be 'L' or 'R'.其中 d 是方向,可以是“L”或“R”。 And node->r and node->l is right and left child of a node respectively. node->r 和 node->l 分别是一个节点的左右子节点。 I am trying to remove tail recursion from this so that it is functionally equivalent - it makes two recursive function calls now but I want it to make one.我试图从中删除尾递归,以便它在功能上等效 - 它现在进行两次递归函数调用,但我希望它进行一次。 How can I rewrite the function such that it achieves this goal?如何重写函数以实现此目标? Thank you.谢谢你。
The most straight-forward approach would be something along the lines of最直接的方法是
void treetraverse (tnode *node)
{
do
{
if (node == NULL)
{
return;
}
fprintf(stdout,"%d",node->val);
tnode *node1;
tnode *node2;
if (node-> d == 'L')
{
node1 = node->r;
node2 = node->l;
}
else
{
node1 = node->l;
node2 = node->r;
}
treetraverse(node1);
node = node2;
}
while (true);
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.