2022/01/02 글 목록

1026. Maximum Difference Between Node and Ancestor

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b. Example 1: Input: root = [8,3,10,1,6,null,14,null,null,4,7,13] Output: 7 Explanation: We have va..

Algorithm/LeetCode Daily Challenge 2022. 1. 2. 10:30

이전 1 다음

이전 다음

공지사항

최근에 올라온 글