2
2
comments : true
3
3
difficulty : 中等
4
4
edit_url : https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/README.md
5
+ tags :
6
+ - 树
7
+ - 深度优先搜索
8
+ - 二叉树
9
+ - 排序
5
10
---
6
11
7
12
<!-- problem:start -->
@@ -33,9 +38,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-
33
38
34
39
<p ><strong >解释:</strong ></p >
35
40
36
- <p ><img alt =" " src =" https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/image.jpg " style =" width : 300 px ; height : 175 px ;" /></p >
41
+ <p ><img alt =" " src =" https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/tmpresl95rp-1.png " style =" width : 400 px ; height : 173 px ;" /></p >
37
42
38
- <p >完美二叉子树的根节点在图中以黑色突出显示。它们的大小按降序排列为 <code >[3, 3, 1, 1, 1, 1, 1, 1]</code >。<br />
43
+ <p >完美二叉子树的根节点在图中以黑色突出显示。它们的大小按非递增顺序排列为 <code >[3, 3, 1, 1, 1, 1, 1, 1]</code >。<br />
39
44
第 <code >2</code > 大的完美二叉子树的大小是 3。</p >
40
45
</div >
41
46
@@ -48,9 +53,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-
48
53
49
54
<p ><strong >解释:</strong ></p >
50
55
51
- <p ><img alt =" " src =" https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/image1.jpg " style =" width : 300px ; height : 149 px ;" /></p >
56
+ <p ><img alt =" " src =" https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/tmp_s508x9e-1.png " style =" width : 300px ; height : 189 px ;" /></p >
52
57
53
- <p >完美二叉子树的大小按降序排列为 <code >[7, 3, 3, 1, 1, 1, 1]</code >。最大的完美二叉子树的大小是 7。</p >
58
+ <p >完美二叉子树的大小按非递增顺序排列为 <code >[7, 3, 3, 1, 1, 1, 1]</code >。最大的完美二叉子树的大小是 7。</p >
54
59
</div >
55
60
56
61
<p ><strong class =" example " >示例 3:</strong ></p >
@@ -62,9 +67,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-
62
67
63
68
<p ><strong >解释:</strong ></p >
64
69
65
- <p ><img alt =" " src =" https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/image4.jpg " style =" width : 150 px ; height : 130 px ;" /></p >
70
+ <p ><img alt =" " src =" https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/tmp74xnmpj4-1.png " style =" width : 250 px ; height : 225 px ;" /></p >
66
71
67
- <p >完美二叉子树的大小按降序排列为 <code >[1, 1]</code >。完美二叉子树的数量少于 3。</p >
72
+ <p >完美二叉子树的大小按非递增顺序排列为 <code >[1, 1]</code >。完美二叉子树的数量少于 3。</p >
68
73
</div >
69
74
70
75
<p >  ; </p >
0 commit comments