mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Update.二叉树的递归遍历,添加C#版
This commit is contained in:
@ -565,6 +565,60 @@ impl Solution {
|
||||
}
|
||||
```
|
||||
|
||||
### C#
|
||||
```C#
|
||||
// 前序遍历
|
||||
public IList<int> PreorderTraversal(TreeNode root)
|
||||
{
|
||||
var res = new List<int>();
|
||||
if (root == null) return res;
|
||||
Traversal(root, res);
|
||||
return res;
|
||||
|
||||
}
|
||||
public void Traversal(TreeNode cur, IList<int> res)
|
||||
{
|
||||
if (cur == null) return;
|
||||
res.Add(cur.val);
|
||||
Traversal(cur.left, res);
|
||||
Traversal(cur.right, res);
|
||||
}
|
||||
```
|
||||
```C#
|
||||
// 中序遍历
|
||||
public IList<int> InorderTraversal(TreeNode root)
|
||||
{
|
||||
var res = new List<int>();
|
||||
if (root == null) return res;
|
||||
Traversal(root, res);
|
||||
return res;
|
||||
}
|
||||
public void Traversal(TreeNode cur, IList<int> res)
|
||||
{
|
||||
if (cur == null) return;
|
||||
Traversal(cur.left, res);
|
||||
res.Add(cur.val);
|
||||
Traversal(cur.right, res);
|
||||
}
|
||||
```
|
||||
```C#
|
||||
// 后序遍历
|
||||
public IList<int> PostorderTraversal(TreeNode root)
|
||||
{
|
||||
var res = new List<int>();
|
||||
if (root == null) return res;
|
||||
Traversal(root, res);
|
||||
return res;
|
||||
}
|
||||
public void Traversal(TreeNode cur, IList<int> res)
|
||||
{
|
||||
if (cur == null) return;
|
||||
Traversal(cur.left, res);
|
||||
Traversal(cur.right, res);
|
||||
res.Add(cur.val);
|
||||
}
|
||||
```
|
||||
|
||||
<p align="center">
|
||||
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
|
||||
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
||||
|
Reference in New Issue
Block a user