[백준/BOJ] 백준 26111번 : Parentheses Tree

https://www.acmicpc.net/problem/26111 26111번: Parentheses Tree A rooted ordered tree $T$ can be expressed as a string of matched parentheses $p(T)$. The string representation $p(T)$ can be defined recursively. As a base case, a tree consisting of a single node is expressed by a pair of parentheses (). When a rooted or www.acmicpc.net 스택에 문자열의 '(' 문자를 넣어가다가, ')' 문자가 나오면, 마지막에 들어온 '('가 해당 ')'의 직전에..

2023.04.11