Binary Tree(이진 트리)

10/12 (목) Puppeteer에 발생한 CORS 문제 우회 성공 TIL, TIT

공부한 것LeetCode #106. Construct Binary Tree from Inorder and Postorder TraversalLeetCode - The World's Leading Online Programming Learning PlatformLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/ChatGPT에게 내..

10/11 (수) 브라우저에 막대 그룹 그래프를 그리다 TIL

공부한 것LeetCode #106. Construct Binary Tree from Inorder and Postorder TraversalLeetCode - The World's Leading Online Programming Learning PlatformLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/진행중이다. 다음 규..

10/10 (화) 콘솔에 선 그래프를 그리다 TIL

공부한 것LeetCode #671. Second Minimum Node In a Binary TreeLeetCode - The World's Leading Online Programming Learning PlatformLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/description/Easy 난이도 문제인데 은근히 오래 걸렸다. 재귀 해법으로 스스로 풀어냈다는 점이 고무적이다. 진..

9/29 (금) 순회 결과로부터 역으로 트리 구하기 TIL

공부한 것LeetCode #105. Construct Binary Tree from Preorder and Inorder TraversalLeetCode - The World's Leading Online Programming Learning PlatformLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/이진 트리의 전위와 중위..

9/26 (화) 이진 트리 후위 순회 구현 TIL

공부한 것LeetCode #145. Binary Tree Postorder TraversalLeetCode - The World's Leading Online Programming Learning PlatformLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/binary-tree-postorder-traversal/description/후위 순회(Postorder traversal): ‘나’와 두 자식을 기준으로, “왼 자식 → 오른 자식 → 나” 순..

9/25 (월) 이진 트리 전위 순회와 중위 순회 구현하기 TIL

공부한 것LeetCode #144. Binary Tree Preorder TraversalLeetCode - The World's Leading Online Programming Learning PlatformLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/binary-tree-preorder-traversal/description/전위 순회(Preorder traversal): ‘나’와 두 자식을 기준으로, “나 → 왼 자식 → 오른 자식” 순으로 ..