JSH

var graph = new Graph(); var seoul = graph.AddVertex("서울"); var gangneung = graph.AddVertex("강릉"); var daejeon = graph.AddVertex("대전"); var daegu = graph.AddVertex("대구"); var busan = graph.AddVertex("부산"); graph.AddEdge(seoul, gangneung, 10); graph.AddEdge(seoul, daegu, 7); graph.AddEdge(seoul, daejeon, 6); graph.AddEdge(daejeon, busan, 7); graph.AddEdge(daegu, busan, 3); graph.AddEdge(daegu, ga..

Add BinaryTree bt = new BinaryTree(); Node root = bt.AddChild(bt.Root, 50); // Binary Search Tree(이진 탐색 트리) bt.AddChild(root, 30); bt.AddChild(root, 1); bt.AddChild(root, 35); bt.AddChild(root, 70); bt.AddChild(root, 60); bt.AddChild(root, 80); public Node AddChild(Node root, int data) // Binary Search Tree 이진 탐색 트리 { if (root == null) return new Node(data); while (true) { if (data < root.Data) ..

후위 순회 post-order Recursive 후위 순회 post-order Stack public void PostOrderStack(Node root) { Stack stack = new Stack(); Node temp = root; Node prev = null; // Pop으로 반환한 값을 저장할 변수 while (temp != null || stack.Count != 0) { if (temp != null) { stack.Push(temp); temp = temp.Left; } else { temp = stack.Peek(); if (temp.Right == null || temp.Right == prev) // temp의 오른쪽이 비어있거나 이전에 Pop한 값이랑 같을때 { prev = s..

중위 순회 in-order Recursive public void InOrder(Node root) // 이진 트리 Recursive in-order { if (root.Left != null) InOrder(root.Left); Console.WriteLine(root.Data); if (root.Right != null) InOrder(root.Right); } 중위 순회 in-order Stack public void InOrderStack(Node root) // 이진 트리 Stack in-order { Stack nodes = new Stack(); while (true) { while (root != null) { nodes.Push(root); root = root.Left; } if (no..

pre-order Recursive bt.PreOrder(root); public void PreOrder(Node root) { Console.WriteLine(root.Data); if (root.Left != null) PreOrder(root.Left); if (root.Right != null) PreOrder(root.Right); } pre-order Stack bt.PreOrder(root); public void PreOrder(Node root) // 이진 트리 Stack pre-order { Stack nodes = new Stack(); nodes.Push(root); while(nodes.Count > 0) { Node temp = nodes.Pop(); Console.WriteL..

class App { public App() { var bt = new BinaryTree(15); bt.AddRoot("F"); bt.AddLeft(0, "B"); bt.AddRight(0, "G"); bt.AddLeft(1, "A"); bt.AddRight(1, "D"); bt.AddRight(2, "I"); bt.AddLeft(4, "C"); bt.AddRight(4, "E"); bt.AddLeft(6, "H"); bt.Print(); } } class BinaryTree { public string[] root; public BinaryTree(int data) { root = new string[data]; } public void AddRoot(string data) { if (root[0] ..

Left Skewed Tree class App { public App() { BinaryTree bt = new BinaryTree(); Node root = bt.AddChild(bt.Root, 1); Node nodeB = bt.AddChild(root, 2); Node nodeC = bt.AddChild(nodeB, 3); Node nodeD = bt.AddChild(nodeC, 4); } } Recursive Print public void Print(Node root) { if (root == null) return; Console.WriteLine("Print: {0}", root.Data); PrintRecursive(root.Left); } private void PrintRecursiv..

class App { public App() { BinaryTree bt = new BinaryTree(); Node root = bt.AddChild(bt.Root, 1); bt.AddChild(root, 2); bt.AddChild(root, 3); bt.AddChild(root, 4); bt.AddChild(root, 5); bt.AddChild(root, 6); bt.AddChild(root, 7); bt.LevelOrder(root); } } class BinaryTree { public class Node { public int Data { get; private set; } public Node Left; public Node Right; public Node(int data) { Data ..

class App { public App() { Tree bt = new Tree(); Node root = bt.AddChild(bt.Root, "A", "A"); // (Node root, string target, string data) bt.AddChild(root, "A", "B"); bt.AddChild(root, "A", "C"); bt.AddChild(root, "A", "D"); bt.AddChild(root, "B", "E"); bt.AddChild(root, "C", "F"); bt.AddChild(root, "D", "G"); bt.AddChild(root, "D", "H"); bt.AddChild(root, "D", "I"); bt.AddChild(root, "H", "J"); b..

나무구조, 계층적 자료구조 public App() { BinaryTree bt = new BinaryTree(); Node root = bt.AddChild(bt.Root, "A"); bt.AddChild(root, "B"); bt.AddChild(root, "C"); bt.AddChild(root, "D"); } class BinaryTree { public class Node { public string Data { get; private set; } public Node Left { get; set; } public Node Right { get; set; } public Node(string data) { this.Data = data; } } public Node Root { get; priva..