public MyBinaryTreeNode <int> IterativeSearch(MyBinaryTreeNode <int> rootNode, int value)
{
var currentNode = rootNode;
while (true)
{
if (currentNode == null)
{
break;
}
if (currentNode.Value == value)
{
return(currentNode);
}
else if (currentNode.Value > value)
{
currentNode = currentNode.Left;
}
else
{
currentNode = currentNode.Right;
}
}
return(null);
}
public void RecursivePrintInOrder(MyBinaryTreeNode <T> node)
{
if (node == null)
{
return;
}
RecursivePrintInOrder(node.Left);
Console.WriteLine(node.Value);
RecursivePrintInOrder(node.Right);
}
public void IterativePrintInOrder(MyBinaryTreeNode <T> rootNode)
{
var stack = new MyStack <MyBinaryTreeNode <T> >();
var currentNode = rootNode;
while (stack.Count > 0 || currentNode != null)
{
if (currentNode != null)
{
stack.Push(currentNode);
currentNode = currentNode.Left;
}
else
{
var node = stack.Pop();
Console.WriteLine(node.Value);
currentNode = node.Right;
}
}
}
public MyBinaryTreeNode <int> RecursiveSearch(MyBinaryTreeNode <int> rootNode, int value)
{
if (rootNode == null)
{
return(null);
}
if (rootNode.Value == value)
{
return(rootNode);
}
else if (rootNode.Value > value)
{
return(RecursiveSearch(rootNode.Left, value));
}
else
{
return(RecursiveSearch(rootNode.Right, value));
}
}
public void IterativePrintPreOrder(MyBinaryTreeNode <T> rootNode)
{
var stack = new MyStack <MyBinaryTreeNode <T> >();
stack.Push(rootNode);
while (stack.Count > 0)
{
var node = stack.Pop();
Console.WriteLine(node.Value);
if (node.Right != null)
{
stack.Push(node.Right);
}
if (node.Left != null)
{
stack.Push(node.Left);
}
}
}
