@@ -565,6 +565,60 @@ impl Solution {
565565}
566566```
567567
568+ ### C#
569+ ``` C#
570+ // 前序遍历
571+ public IList < int > PreorderTraversal (TreeNode root )
572+ {
573+ var res = new List <int >();
574+ if (root == null ) return res ;
575+ Traversal (root , res );
576+ return res ;
577+ 578+ }
579+ public void Traversal (TreeNode cur , IList < int > res )
580+ {
581+ if (cur == null ) return ;
582+ res .Add (cur .val );
583+ Traversal (cur .left , res );
584+ Traversal (cur .right , res );
585+ }
586+ ```
587+ ``` C#
588+ // 中序遍历
589+ public IList < int > InorderTraversal (TreeNode root )
590+ {
591+ var res = new List <int >();
592+ if (root == null ) return res ;
593+ Traversal (root , res );
594+ return res ;
595+ }
596+ public void Traversal (TreeNode cur , IList < int > res )
597+ {
598+ if (cur == null ) return ;
599+ Traversal (cur .left , res );
600+ res .Add (cur .val );
601+ Traversal (cur .right , res );
602+ }
603+ ```
604+ ``` C#
605+ // 后序遍历
606+ public IList < int > PostorderTraversal (TreeNode root )
607+ {
608+ var res = new List <int >();
609+ if (root == null ) return res ;
610+ Traversal (root , res );
611+ return res ;
612+ }
613+ public void Traversal (TreeNode cur , IList < int > res )
614+ {
615+ if (cur == null ) return ;
616+ Traversal (cur .left , res );
617+ Traversal (cur .right , res );
618+ res .Add (cur .val );
619+ }
620+ ```
621+ 568622<p align =" center " >
569623<a href =" https://programmercarl.com/other/kstar.html " target =" _blank " >
570624 <img src =" ../pics/网站星球宣传海报.jpg " width =" 1000 " />
0 commit comments