File tree Expand file tree Collapse file tree 1 file changed +41
-0
lines changed Expand file tree Collapse file tree 1 file changed +41
-0
lines changed Original file line number Diff line number Diff line change @@ -1231,6 +1231,47 @@ impl Solution {
1231
1231
}
1232
1232
```
1233
1233
1234
+ #### C #:
1235
+
1236
+ ```C # 199. 二叉树的右视图
1237
+ public class Solution
1238
+ {
1239
+ public IList<int> RightSideView (TreeNode root )
1240
+ {
1241
+ var result = new List<int> ();
1242
+ Queue<TreeNode > queue = new ();
1243
+
1244
+ if (root != null )
1245
+ {
1246
+ queue. Enqueue (root);
1247
+ }
1248
+ while (queue. Count > 0 )
1249
+ {
1250
+ int count = queue. Count ;
1251
+ int lastValue = count - 1 ;
1252
+ for (int i = 0 ; i < count; i++ )
1253
+ {
1254
+ var currentNode = queue. Dequeue ();
1255
+ if (i == lastValue)
1256
+ {
1257
+ result. Add (currentNode. val);
1258
+ }
1259
+
1260
+ // lastValue == i == count -1 : left 先于 right 进入Queue
1261
+ if (currentNode. left != null ) queue. Enqueue (currentNode. left);
1262
+ if (currentNode. right != null ) queue. Enqueue (currentNode. right);
1263
+
1264
+ // // lastValue == i == 0: right 先于 left 进入Queue
1265
+ // if(currentNode.right !=null ) queue.Enqueue(currentNode.right);
1266
+ // if(currentNode.left !=null ) queue.Enqueue(currentNode.left);
1267
+ }
1268
+ }
1269
+
1270
+ return result;
1271
+ }
1272
+ }
1273
+ ```
1274
+
1234
1275
## 637. 二叉树的层平均值
1235
1276
1236
1277
[力扣题目链接](https: // leetcode.cn/problems/average-of-levels-in-binary-tree/)
You can’t perform that action at this time.
0 commit comments