250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록binary tree (1)
N
(Leet Code c++)Minimum Depth of Binary Tree
111. Minimum Depth of Binary Tree Easy 2713843Add to ListShare Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note: A leaf is a node with no children. Example 1: Input: root = [3,9,20,null,null,15,7] Output: 2 Example 2: Input: root = [2,null,3,null,4,null,5,null,6] Output: 5 Constrai..
Leet Code 알고리즘
2021. 7. 15. 14:26