dfs1 [LeetCode] 104. Maximum Depth of Binary Tree (golang) 문제Maximum Depth of Binary Tree - LeetCodeLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/maximum-depth-of-binary-tree/이진 트리에서 최대 깊이 구하기 구현모든 가지를 탐색하여 깊이를 갱신 ( N ) 시간 복잡도O(N) 코드/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Righ.. 2021. 6. 7. 이전 1 다음
