38 lines
475 B
Markdown
38 lines
475 B
Markdown
|
# Leetcode Maximum-Depth-Of-Binary-Tree
|
||
|
|
||
|
#### 2022-07-05 09:25
|
||
|
|
||
|
> ##### Algorithms:
|
||
|
> #algorithm #BFS
|
||
|
> ##### Data structures:
|
||
|
> #DS #binary_tree
|
||
|
> ##### Difficulty:
|
||
|
> #coding_problem #difficulty-easy
|
||
|
> ##### Additional tags:
|
||
|
> #leetcode
|
||
|
> ##### Revisions:
|
||
|
> N/A
|
||
|
|
||
|
##### Related topics:
|
||
|
```expander
|
||
|
tag:#BFS
|
||
|
```
|
||
|
|
||
|
|
||
|
|
||
|
##### Links:
|
||
|
- [Link to problem]()
|
||
|
___
|
||
|
### Problem
|
||
|
|
||
|
#### Examples
|
||
|
|
||
|
#### Constraints
|
||
|
|
||
|
### Thoughts
|
||
|
|
||
|
> [!summary]
|
||
|
> This is a #template_remove_me
|
||
|
|
||
|
### Solution
|