mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 01:15:57 +08:00
添加内容
This commit is contained in:
@ -1,7 +1,7 @@
|
||||
# [662. Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)
|
||||
|
||||
|
||||
## 题目:
|
||||
## 题目
|
||||
|
||||
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a **full binary tree**, but some nodes are null.
|
||||
|
||||
|
Reference in New Issue
Block a user