[LeetCode | Java | DFS 문제 풀이] 226. Invert Binary Tree - Solution with DFS
99클럽 | 비기너🌲 226. Invert Binary Tree🏷 Topic : Tree DFS; Depth-First Search BFS; Breadth-First Search Binary TreeEasyGiven the root of a binary tree, invert the tree, and return its root.Example 1:Input: root = [4,2,7,1,3,6,9]Output: [4,7,2,9,6,3,1]Example 2:Input: root = [2,1,3]Output: [2,3,1]Example 3:Input: root = []Output: []Constraints:The number of nodes in the tree is in the range [0, 100..
2024. 6. 2.
⇧
Top