public override void Run()
{
var root = Create(0, 1, 2, 3, 4, 5, 6);
BTreePrinter.Print(root);
Console.WriteLine("Solution 1");
var sol1 = new Solution1();
var result = sol1.Convert(root);
Display(result.Head);
Console.WriteLine("Solution 2");
root = Create(0, 1, 2, 3, 4, 5, 6);
var sol2 = new Solution2();
var result2 = sol2.Convert(root);
Display(result2);
Console.WriteLine("Solution 3");
root = Create(0, 1, 2, 3, 4, 5, 6);
var sol3 = new Solution3();
var result3 = sol3.Convert(root);
Display(result3);
}
static void Main(string[] args)
{
BTree bTree = new BTree();
bTree.AddItem(10);
bTree.AddItem(5);
bTree.AddItem(15);
bTree.AddItem(2);
bTree.AddItem(7);
bTree.AddItem(12);
bTree.AddItem(17);
bTree.AddItem(1);
bTree.AddItem(3);
bTree.AddItem(6);
bTree.AddItem(8);
bTree.AddItem(11);
bTree.AddItem(13);
bTree.AddItem(16);
bTree.AddItem(18);
BTreePrinter.Print(bTree.GetRoot(), 0, 32);
var b = BTreeSearch.BFS(bTree.GetRoot(), 18);
var d = BTreeSearch.DFS(bTree.GetRoot(), 18);
}
private static void PrintTree(TreeNode root)
{
BTreePrinter.Print(root);
var isBalanced1 = IsBalanced(root);
if (isBalanced1)
{
Console.WriteLine("Tree is balanced");
}
else
{
Console.WriteLine("Tree is not balalnced");
}
var isBalanced2 = IsBalancedBook(root);
if (IsBalancedBook(root))
{
Console.WriteLine("Tree is balanced");
}
else
{
Console.WriteLine("Tree is not balalnced");
}
}
private static void PrintTree(TreeNode root)
{
BTreePrinter.Print(root);
var watch = System.Diagnostics.Stopwatch.StartNew();
var isBalanced1 = IsBalanced(root);
watch.Stop();
var elapsedMs = watch.ElapsedMilliseconds;
if (isBalanced1)
{
Console.WriteLine("Tree is balanced");
}
else
{
Console.WriteLine("Tree is not balalnced");
}
Console.WriteLine($"Elapsed milliconds {elapsedMs}");
watch = System.Diagnostics.Stopwatch.StartNew();
var isBalanced2 = IsBalancedBook(root);
watch.Stop();
elapsedMs = watch.ElapsedMilliseconds;
if (IsBalancedBook(root))
{
Console.WriteLine("Tree is balanced");
}
else
{
Console.WriteLine("Tree is not balalnced");
}
Console.WriteLine($"Elapsed milliconds {elapsedMs}");
}
public override void Run()
{
var tree = Q4_02_CreateMinimalBSTfromSortedUniqueArray.Create(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
var nodeToReplace = tree.Find(6);
TreeNode newTree = nodeToReplace.Replace(11);
BTreePrinter.Print(tree);
BTreePrinter.Print(newTree);
}
public override void Run()
{
var root = Q4_02_CreateMinimalBSTfromSortedUniqueArray.Create(1, 2, 3);
BTreePrinter.Print(root);
var results = AllSequences(root);
foreach (var list in results)
{
AssortedMethods.PrintList(list);
}
}
private static void Print(TreeNode tree, TreeNode subTree)
{
BTreePrinter.Print(tree);
BTreePrinter.Print(subTree);
if (ContainsTree(tree, subTree))
{
Console.WriteLine("It is a sub tree");
}
else
{
Console.WriteLine("It is not a sub tree");
}
}
private static void PrintTree(TreeNode root)
{
BTreePrinter.Print(root);
var isValidBST = IsValidBST(root);
if (isValidBST)
{
Console.WriteLine("Tree is a valid BST");
}
else
{
Console.WriteLine("Tree is not a valid BST");
}
}
public override void Run()
{
var tree = Q4_02_CreateMinimalBSTfromSortedUniqueArray.Create(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
var listOfDepths = ListOfDepths(tree);
BTreePrinter.Print(tree);
foreach (var list in listOfDepths)
{
foreach (var sbList in list)
{
Console.Write($"{sbList.Data},");
}
Console.WriteLine();
}
}
static void Main(string[] args)
{
var tree = TreeNode.Create(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
var listofDepths = ListOfDepths(tree);
BTreePrinter.Print(tree);
//foreach (var item in listofDepths)
//{
// foreach (var sblist in item)
// {
// Console.WriteLine($"{sblist.Data}");
// }
// Console.WriteLine();
//}
}
public override void Run()
{
var root = Create(1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
BTreePrinter.Print(root);
}
public void Print()
{
BTreePrinter.Print(root);
}
