{"rsdb":{"rid":"239754","subhead":"","postdate":"0","aid":"165211","fid":"54","uid":"1","topic":"1","content":"<p><strong>C#\u5b9e\u73b0\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u3001\u4e2d\u5e8f\u3001\u540e\u5e8f\u904d\u5386\u3002<\/strong><\/p><br\/><p>public class BinaryTreeNode <br \/>&nbsp; &nbsp; { <br \/>&nbsp; &nbsp; &nbsp; &nbsp; int value; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; BinaryTreeNode left; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; BinaryTreeNode right; <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ \u524d\u5e8f\u904d\u5386 <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;\/summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;param name=&quot;tree&quot;&gt;&lt;\/param&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; public static void PreOrder(BinaryTreeNode tree) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; { <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (tree == null) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return; <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.Console.Write(tree.value + &quot; &quot;); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PreOrder(tree.left); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; PreOrder(tree.right); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; } <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ \u524d\u5e8f\u904d\u5386\u5faa\u73af\u5b9e\u73b0 <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;\/summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;param name=&quot;tree&quot;&gt;&lt;\/param&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; public static void PreOrderLoop(BinaryTreeNode tree) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; { <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (tree == null) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Stack&lt;BinaryTreeNode&gt; stack = new Stack&lt;BinaryTreeNode&gt;(); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; BinaryTreeNode node = tree; <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(node != null || stack.Any()){ <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(node != null) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; { <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; stack.Push(node); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.Console.Write(node.value + &quot; &quot;); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; node = node.left; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; { <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; var item = stack.Pop(); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; node = item.right; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } <br \/>&nbsp; &nbsp; &nbsp; &nbsp; } <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ \u4e2d\u5e8f\u904d\u5386 <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;\/summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;param name=&quot;tree&quot;&gt;&lt;\/param&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; public static void InOrder(BinaryTreeNode tree) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; { <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (tree == null) <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return; <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; InOrder(tree.left); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.Console.Write(tree.value + &quot; &quot;); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; InOrder(tree.right); <br \/>&nbsp; &nbsp; &nbsp; &nbsp; } <br \/>&nbsp; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ \u4e2d\u5e8f\u904d\u5386\u5faa\u73af\u5b9e\u73b0 <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;\/summary&gt; <br \/>&nbsp; &nbsp; &nbsp; &nbsp; \/\/\/ &lt;par","orderid":"0","title":"C#\u5b9e\u73b0\u4e8c\u53c9\u6811\u7684\u904d\u5386(\u4e00)","smalltitle":"","mid":"0","fname":"linux\u7f16\u7a0b\u57fa\u7840","special_id":"0","bak_id":"0","info":"0","hits":"5293","pages":"4","comments":"0","posttime":"2017-10-18 09:07:50","list":"1508288870","username":"admin","author":"","copyfrom":"","copyfromurl":"","titlecolor":"","fonttype":"0","titleicon":"0","picurl":"https:\/\/www.cppentry.com\/upload_files\/","ispic":"0","yz":"1","yzer":"","yztime":"0","levels":"0","levelstime":"0","keywords":"<A HREF='https:\/\/www.cppentry.com\/do\/search.php?type=keyword&keyword=%CA%B5%CF%D6' target=_blank>\u5b9e\u73b0<\/A>","jumpurl":"","iframeurl":"","style":"","template":"a:3:{s:4:\"head\";s:0:\"\";s:4:\"foot\";s:0:\"\";s:8:\"bencandy\";s:0:\"\";}","target":"0","ip":"113.108.110.181","lastfid":"0","money":"0","buyuser":"","passwd":"","allowdown":"","allowview":"","editer":"","edittime":"0","begintime":"0","endtime":"0","description":"C#\u5b9e\u73b0\u4e8c\u53c9\u6811\u7684\u904d\u5386","lastview":"1709246886","digg_num":"512","digg_time":"1713431422","forbidcomment":"0","ifvote":"0","heart":"","htmlname":"","city_id":"0"},"page":"1"}