전위순회1 [leetcode 114] Flatten Binary Tree to Linked List Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 문제 풀이: - 순서가 root->left->right 순서: preorder임 - 스택을 사용해서 preorder 순회하기 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * Tr.. 2020. 10. 21. 이전 1 다음