목록이진 트리 (3)
N
(Leet Code c++)Binary Tree Paths
257. Binary Tree Paths Easy 2876145Add to ListShare Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children. Example 1: Input: root = [1,2,3,null,5] Output: ["1->2->5","1->3"] Example 2: Input: root = [1] Output: ["1"] Constraints: The number of nodes in the tree is in the range [1, 100]. -100 right가 모두 NULL 인 경우 리프 노드이기 때문에 (현재까지의 노드 경로) + ..
(Leet Code c++)Path Sum
112. Path Sum Easy 3500644Add to ListShare Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum. A leaf is a node with no children. Example 1: Input: root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22 Output: true Example 2: Input: root = [1,2,3], targetSum = 5 Ou..
(Leet Code c++)Binary Tree Inorder Traversal
94. Binary Tree Inorder Traversal Given the root of a binary tree, return the inorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] Example 2: Input: root = [] Output: [] Example 3: Input: root = [1] Output: [1] Example 4: Input: root = [1,2] Output: [2,1] Example 5: Input: root = [1,null,2] Output: [1,2] Constraints: The number of nodes in the tree is in ..