public static void Run()
{
var initNode = TreeInitializer.Initialize();
ConvertToBinaryTree(initNode.treeNode, 7);
Console.WriteLine($"ConvertToBinaryTree - IsBST : {CheckIfBinaryTreeBST.IsBinarySearchTree(initNode.treeNode)} ");
}
public static void Run()
{
var initNode = TreeInitializer.Initialize();
Console.WriteLine($"IsBST : {IsBinarySearchTree(initNode.treeNode)} ");
Console.WriteLine($"IsBST : {IsBinarySearchTree(initNode.bstNode)} ");
}
public static void Run()
{
var initNode = TreeInitializer.Initialize();
Console.WriteLine($"Height of Tree : {Height(initNode.treeNode)}");
Node <int> newNodeToAdd = new Node <int>()
{
Value = 25
};
AddNewNodeAndTranformToBST(initNode.treeNode, newNodeToAdd);
Console.WriteLine($"AddNewNodeAndTranformToBST - IsBST : {CheckIfBinaryTreeBST.IsBinarySearchTree(initNode.treeNode)} ");
}
public static void Run()
{
var initNode = TreeInitializer.Initialize();
Node <int> newNodeForBST = new Node <int>()
{
Value = 4
};
AddNewNodeToBST(initNode.bstNode, newNodeForBST);
Console.WriteLine($"AddNewNodeToBST - IsBST : {CheckIfBinaryTreeBST.IsBinarySearchTree(initNode.bstNode)} ");
Console.WriteLine($"InOrder for BST : ");
TreeTraversal.InOrderTraversal(initNode.bstNode);
}
public static void Run()
{
var initNode = TreeInitializer.Initialize();
Console.Write("InOrder Traversal :");
InOrderTraversal(initNode.treeNode);
Console.WriteLine();
Console.Write("PreOrder Traversal :");
PreOrderTraversal(initNode.treeNode);
Console.WriteLine();
Console.Write("PostOrder Traversal :");
PostOrderTraversal(initNode.treeNode);
Console.WriteLine();
}
