public static void InsertNodeToTreeNonRoot() { root = InsertInTree.InsertIntoTree(root, 30); root = InsertInTree.InsertIntoTree(root, 20); root = InsertInTree.InsertIntoTree(root, 40); root = InsertInTree.InsertIntoTree(root, 70); root = InsertInTree.InsertIntoTree(root, 60); root = InsertInTree.InsertIntoTree(root, 80); LevelOrderTrversal.LevelOrderTraversalTree(root); Console.ReadKey(); }
public void InsertNodeToTreeNonRoot() { root = InsertInTree.InsertIntoTree(root, 30); root = InsertInTree.InsertIntoTree(root, 20); root = InsertInTree.InsertIntoTree(root, 40); root = InsertInTree.InsertIntoTree(root, 70); root = InsertInTree.InsertIntoTree(root, 60); root = InsertInTree.InsertIntoTree(root, 80); PostOrderTrversal.PostOrder(root); Console.ReadKey(); }
public static void InsertNodeToTreeNonRoot() { root = InsertInTree.InsertIntoTree(root, 30); root = InsertInTree.InsertIntoTree(root, 20); root = InsertInTree.InsertIntoTree(root, 40); root = InsertInTree.InsertIntoTree(root, 70); root = InsertInTree.InsertIntoTree(root, 60); root = InsertInTree.InsertIntoTree(root, 80); //DeleteInTree.DeleteNodeOfBST(root,20); DeleteInTree.DeleteNodeOfBST(root, 30); Console.ReadKey(); }
public void InsertNodeToTreeNonRoot() { //tree.insert(50); //tree.insert(30); //tree.insert(20); //tree.insert(40); //tree.insert(70); //tree.insert(60); //tree.insert(80); root = InsertInTree.InsertIntoTree(root, 30); root = InsertInTree.InsertIntoTree(root, 20); root = InsertInTree.InsertIntoTree(root, 40); root = InsertInTree.InsertIntoTree(root, 70); root = InsertInTree.InsertIntoTree(root, 60); root = InsertInTree.InsertIntoTree(root, 80); }
public static void InsertNodeToTreeRoot() { root = InsertInTree.InsertIntoTree(null, 50); InsertNodeToTreeNonRoot(); }