1 min read
Tree Traversal Binary Tree
Pre-Order Pre-order traversal 은 tree 를 순회할 때 현재 node 를 먼저 방문하고, 그 다음 left subtree, right subtree 순서로 방문하는 방식이다.
Inorder Search 는 root 를 중간 단계에서 search 하는 방식이다. Traverse the left subtree Visit the root.
Backtracking search Related References.
DFS Related References.
Sorting Insertion Sort Selection Sort Merge Sort Bubble Sort quick Sort Heap Sort Related References.
Prim Algorithm B) Related C) References.
Dijkstra Algorithm B) Related C) References.
Greedy Algorithm B) Related C) References.
FIFO 2. Related 3. References.
Caterpillar Method Related References.