3.7.2 In-Order Traversal(중위 순회)

CS - 3. Common Algorithms - 3.7 Tree - 3.7.2 In-Order Traversal In-Order Traversal 💡In-order traversal is a tree traversal algorithm that visits the left subtree, the root, and then the right subtree. This is the most common way to traverse a binary search tree. It is also used to create a sorted list of nodes in a binary search tree. 중위 순회(Inorder Traversal)은 왼쪽 하위 트리, 루트, 오른쪽 하위 트리를 차례로 방문하는 트..

2024.02.09