목록366. Find Leaves of Binary Tree (1)

Scribbling

LeetCode: 366. Find Leaves of Binary Tree

# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def findLeaves(self, root: Optional[TreeNode]) -> List[List[int]]: self.ret = [] self.dfs(root) return self.ret def dfs(self, node): if node.left and node.right: h = max(self.dfs(node.left), self.dfs(node.right)) + 1 e..
Computer Science/Coding Test 2022. 2. 2. 17:34
이전 Prev 1 Next 다음