목록treenode (3)

우사미 코딩

[Leetcode] 437. Path Sum III

1. 문제링크 Path Sum III - LeetCode Can you solve this real interview question? Path Sum III - Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum. The path does not need to start or end at the roo leetcode.com 2. Key Point - targetSum은 어디에나 존재할 수 있다, 모든 노드를 탐색하자 이 꼭 시작과 끝이 root에서 leaf까지의 sum이 아니어도 된다. 현재까지의..
Leetcode 2023. 5. 23. 08:57
[Leetcode] 543. Diameter of Binary Tree

1. 문제링크 Diameter of Binary Tree - LeetCode Can you solve this real interview question? Diameter of Binary Tree - Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path leetcode.com - Diameter : 지름 binary tree에서 제일 긴 path의 길이를 구한다 이 path는 특정노드에 대해서 가장 왼쪽 edge node ->..
Leetcode 2023. 5. 23. 06:39
[Leetcode] 110. Balanced Binary Tree

1. 문제링크 Balanced Binary Tree - LeetCode Can you solve this real interview question? Balanced Binary Tree - Given a binary tree, determine if it is height-balanced. Example 1: [https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg] Input: root = [3,9,20,null,null,15,7] Output: true Exam leetcode.com 2. height-Balanced가 뭐지? 여기서 파란색 볼드를 클릭하면 height-balanced에 대한 설명이 나온다 A height-balanced bina..
Leetcode 2023. 5. 23. 04:59
이전 Prev 1 Next 다음