public double FindMin()
{
Node current = root;
while (!(current.left == null))
current = current.left;
return current.Data;
}
public double FindMax()
{
Node current = root;
while (!(current.right == null))
current = current.right;
return current.Data;
}
这是我的二叉搜索树的函数的迭代解决方案,以找出C#中树中的最小值和最大值。我想改变它递归,但代码似乎并不在这里BST中的迭代和递归解决方案
public double RecurfindMax(Node current)
{
//current = root;
if (current.left == null)
{
return -1;
}
else
//if (current.left != null)
{
return RecurfindMax(current = current.left);
//return current;
}
所以你能告诉我这个代码有什么问题吗?
谢谢我的想法,递归的问题是因为国旗..谢谢 – Rdx