private void button1_Click(object sender, EventArgs e)
{
BinaryTree tree = new BinaryTree();
tree.Init(new int[] { 20, 10, 546, 7, 17, 54, 1434, 3, 9, 17, 29, 2, 29, 1 });
// tree.Init(new int[] { 5, 3, 6 ,4});
int x = 0;
int y = 1000;
int height = 0;
DrawTree(tree.head, x, y,height);
}
static void Main(string[] args)
{
BinaryTree binaryTree = new BinaryTree();
binaryTree.root = new Node(4);
binaryTree.root.left = new Node(2);
binaryTree.root.right = new Node(6);
binaryTree.root.left.left = new Node(1);
binaryTree.root.left.right = new Node(3);
binaryTree.root.right.left = new Node(5);
binaryTree.root.right.right = new Node(7);
//Pre Order Traversal
Console.WriteLine("Pre Order Traversal");
binaryTree.PreOrderTraversal();
//In Order Traversal
Console.WriteLine("In Order Traversal");
binaryTree.InOrderTraversal();
//Post Order Traversal
Console.WriteLine("Post Order Traversal");
binaryTree.PostOrderTraversal();
//Level Order Traversal
IList <IList <int> > levelOrderTraversal = binaryTree.LevelOrderTraversal();
Console.WriteLine("Level Order Traversal");
for (int i = 0; i < levelOrderTraversal.Count; i++)
{
StringBuilder sblevelOrderTraversal = new StringBuilder();
foreach (var item in levelOrderTraversal[i])
{
sblevelOrderTraversal.Append(item);
}
Console.WriteLine("Result at Level " + i + " is " + sblevelOrderTraversal.ToString());
}
//Find Parent of a Node
binaryTree.FindParentofNode(4);
//Find Sibling of a Node
binaryTree.FindSiblingofaNode(3);
//Find Cousins of a Node
Console.WriteLine("Is nodes 3 and 5 cousins: " + binaryTree.IsCousins(3, 5));
//Vertical Order Traversal
IList <IList <int> > verticalOrderTraversal = binaryTree.VerticalOrderTraversal();
for (int i = 0; i < verticalOrderTraversal.Count; i++)
{
StringBuilder sbverticalOrderTraversal = new StringBuilder();
foreach (var item in verticalOrderTraversal[i])
{
sbverticalOrderTraversal.Append(item);
}
Console.WriteLine("Result at Vertical Order Traversal is: " + sbverticalOrderTraversal.ToString());
}
//Minimum Depth/Height of Binary Tree
Console.WriteLine("Minimum Depth of the Binary Tree is: " + binaryTree.MinDepth(binaryTree.root));
//Maximum Depth/Height of Binary Tree
Console.WriteLine("Maximum Depth of the Binary Tree is: " + binaryTree.MaxDepth(binaryTree.root));
//Diameter of Binary Tree
Console.WriteLine("Diameter of the Binary Tree is: " + binaryTree.DiamterofBinaryTree(binaryTree.root));
//Sum of all Leaf Nodes
binaryTree.SumofAllLeafNodes();
//Sum of all Left Leaf Nodes
binaryTree.SumofAllLeftLeafNodes();
//Sum of all Right Leaf Nodes
binaryTree.SumofAllRightLeafNodes();
//Closest Value in Binary Tree
binaryTree.ClosestValueInBinaryTree(binaryTree.root, 3.8);
//Delete a Node in Binary Tree
BinaryTree deleteNodeBinaryTree = new BinaryTree();
deleteNodeBinaryTree.root = new Node(5);
deleteNodeBinaryTree.root.left = new Node(3);
deleteNodeBinaryTree.root.right = new Node(6);
deleteNodeBinaryTree.root.left.left = new Node(2);
deleteNodeBinaryTree.root.left.right = new Node(4);
deleteNodeBinaryTree.root.right.right = new Node(7);
Node deletedResultRoot = deleteNodeBinaryTree.DeleteNodeInBinaryTree(deleteNodeBinaryTree.root, 3);
//Is Valid Binary Search Tree
Console.WriteLine("Is Valid Binary Search Tree: " + binaryTree.isValidBinarySearchTree());
//Check If Binary Trees are Identical
BinaryTree binaryTreeIdentical1 = new BinaryTree();
binaryTreeIdentical1.root = new Node(4);
binaryTreeIdentical1.root.left = new Node(2);
binaryTreeIdentical1.root.right = new Node(6);
binaryTreeIdentical1.root.left.left = new Node(1);
binaryTreeIdentical1.root.left.right = new Node(3);
binaryTreeIdentical1.root.right.left = new Node(5);
binaryTreeIdentical1.root.right.right = new Node(7);
BinaryTree binaryTreeIdentical2 = new BinaryTree();
binaryTreeIdentical2.root = new Node(4);
binaryTreeIdentical2.root.left = new Node(2);
binaryTreeIdentical2.root.right = new Node(6);
binaryTreeIdentical2.root.left.left = new Node(1);
binaryTreeIdentical2.root.left.right = new Node(3);
binaryTreeIdentical2.root.right.left = new Node(5);
binaryTreeIdentical2.root.right.right = new Node(7);
Console.WriteLine("Are these two Binary Trees Identical? Answer: " + binaryTree.checkIfBinaryTreesAreIdentical(binaryTreeIdentical1.root, binaryTreeIdentical2.root));
//Maximum Path Sum of Binary Tree
Console.WriteLine("Maximum path sum of the Binary Tree is: " + binaryTree.MaxPathSum(binaryTree.root));
//Each Branch Sum of Binary Tree
ArrayList branchSumResult = new ArrayList();
branchSumResult = binaryTree.BranchSum();
for (int i = 0; i < branchSumResult.Count; i++)
{
Console.WriteLine("For {0} branch sum is: {1}", i + 1, branchSumResult[i].ToString());
}
//Root to Leaf Paths
List <string> roottoLeafPaths = binaryTree.RootToLeafPath();
Console.WriteLine("List of Root->Leaf Paths are below:");
foreach (string roottoLeafPathItem in roottoLeafPaths)
{
Console.WriteLine(roottoLeafPathItem);
}
//Lowest Common Ancestor
Console.WriteLine("Lowest Common Ancestor of 1 and 3 is: " + binaryTree.LowestCommonAncestor(binaryTree.root, new Node(1), new Node(3)).data);
//Check If Given Trees are Isomorphic
BinaryTree t1 = new BinaryTree();
t1.root = new Node(4);
t1.root.left = new Node(2);
t1.root.right = new Node(6);
BinaryTree t2 = new BinaryTree();
t2.root = new Node(4);
t2.root.left = new Node(2);
t2.root.right = new Node(6);
Console.WriteLine("Are these two tree Isomorphic: " + binaryTree.CheckIfBinaryTreesAreIsomorphic(t1.root, t2.root));
Console.WriteLine("Left View of Binary Tree");
StringBuilder sbLeftView = new StringBuilder();
for (int i = 0; i < levelOrderTraversal.Count; i++)
{
sbLeftView.Append(levelOrderTraversal[i][0]);
}
Console.WriteLine("Result at Left View of Given Binary Tree is: " + sbLeftView.ToString());
Console.WriteLine("Right View of Binary Tree");
StringBuilder sbRightView = new StringBuilder();
for (int i = 0; i < levelOrderTraversal.Count; i++)
{
sbRightView.Append(levelOrderTraversal[i][levelOrderTraversal[i].Count() - 1]);
}
Console.WriteLine("Result at Right View of Given Binary Tree is: " + sbRightView.ToString());
Console.ReadKey();
//Find Path equal to Sum K
//Check if binary tree is part of subtree
//Invert or Mirror Binary Tree
//Boundry Traversal
//08/03/2020
//Top View
//Bottom View
//Reverse Alternate Levels
//Flatten Binary Tree
}
static void Main(string[] args)
{
BinaryTree <int> t1 = new BinaryTree <int>(5);
BinaryTree <int> t2 = new BinaryTree <int>(15);
BinaryTree <int> t = new BinaryTree <int>(25, t1, t2);
}
public BinaryTree(T val, BinaryTree <T> left, BinaryTree <T> right)
{
root = new Node <T>();
root.LeftChild = left.root;
}
