memoization (1) 썸네일형 리스트형 [Leetcode]- Longest ZigZag Path in a Binary Tree (2023/04/19) You are given the root of a binary tree. A ZigZag path for a binary tree is defined as follow: Choose any node in the binary tree and a direction (right or left). If the current direction is right, move to the right child of the current node; otherwise, move to the left child. Change the direction from right to left or from left to right. Repeat the second and third steps until you can't move in.. 이전 1 다음
