본문 바로가기

트리

알고리즘 문제풀이/LeetCode 2021. 4. 17. 17:13 [LeetCode 114] flatten-binary-tree-to-linked-list with JAVA leetcode.com/problems/flatten-binary-tree-to-linked-list Flatten Binary Tree to Linked List - LeetCode Level 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. leetcode.com Given the root of a binary tree, flatten the tree into a "linked list": The "linked list" should use the same TreeNode class where the right..
컴퓨터 사이언스/자료구조와 알고리즘 2021. 4. 17. 16:17 [트리] 전위(Preorder), 중위(Inorder), 후위(Postorder) 전위, 중위, 후위는 tree traversal의 방식이다. Preoder는 root -> left -> right의 순서를 가진다. F -> B -> A -> D -> C -> E -> G -> I -> H Inorder는 left -> root -> right의 순서를 가진다. A -> B -> C -> D -> E -> F -> G -> H -> I Postorder는 left -> right -> root의 순서를 가진다. A -> C -> E -> D -> B -> H -> I -> G -> F 트리 순회 (preorder, inorder, postorder) JAVA 코드 /** * Definition for a binary tree node. * public class TreeNode { *..
알고리즘 문제풀이/LeetCode 2021. 4. 16. 16:40 [LeetCode 101] Symmetric Tree with JAVA leetcode.com/problems/symmetric-tree/ Symmetric Tree - LeetCode Level 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. leetcode.com Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = [1,2,2,3,4,4,3] Output: true Example 2: Input..

티스토리툴바