3.7.3 Post-Order Traversal
CS - 3. Common Algorithms - 3.7 Tree - 3.7.3 Post-Order Traversal Post-Order Traversal 💡Post-order traversal is a type of tree traversal that visits the left subtree, then the right subtree, and finally the root node. This is the opposite of pre-order traversal, which visits the root node first, then the left subtree, and finally the right subtree. 후위 순은 트리의 일종으로 왼쪽 부분 트리, 오른쪽 부분 트리, 그리고 마지막으로 루..
2024.02.10