C#實現(xiàn)二叉樹的前序、中序、后序遍歷。
創(chuàng)新互聯(lián)建站專注為客戶提供全方位的互聯(lián)網(wǎng)綜合服務(wù),包含不限于成都網(wǎng)站設(shè)計、成都做網(wǎng)站、宜黃網(wǎng)絡(luò)推廣、小程序設(shè)計、宜黃網(wǎng)絡(luò)營銷、宜黃企業(yè)策劃、宜黃品牌公關(guān)、搜索引擎seo、人物專訪、企業(yè)宣傳片、企業(yè)代運營等,從售前售中售后,我們都將竭誠為您服務(wù),您的肯定,是我們大的嘉獎;創(chuàng)新互聯(lián)建站為所有大學(xué)生創(chuàng)業(yè)者提供宜黃建站搭建服務(wù),24小時服務(wù)熱線:13518219792,官方網(wǎng)址:muchs.cnpublic class BinaryTreeNode { int value; BinaryTreeNode left; BinaryTreeNode right; /// <summary> /// 前序遍歷 /// </summary> /// <param name="tree"></param> public static void PreOrder(BinaryTreeNode tree) { if (tree == null) return; System.Console.Write(tree.value + " "); PreOrder(tree.left); PreOrder(tree.right); } /// <summary> /// 前序遍歷循環(huán)實現(xiàn) /// </summary> /// <param name="tree"></param> public static void PreOrderLoop(BinaryTreeNode tree) { if (tree == null) return; Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; while(node != null || stack.Any()){ if(node != null) { stack.Push(node); System.Console.Write(node.value + " "); node = node.left; } else { var item = stack.Pop(); node = item.right; } } } /// <summary> /// 中序遍歷 /// </summary> /// <param name="tree"></param> public static void InOrder(BinaryTreeNode tree) { if (tree == null) return; InOrder(tree.left); System.Console.Write(tree.value + " "); InOrder(tree.right); } /// <summary> /// 中序遍歷循環(huán)實現(xiàn) /// </summary> /// <param name="tree"></param> public static void InOrderLoop(BinaryTreeNode tree) { if (tree == null) return; Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; while (node != null || stack.Any()) { if (node != null) { stack.Push(node); node = node.left; } else { var item = stack.Pop(); System.Console.Write(item.value + " "); node = item.right; } } } /// <summary> /// 后序遍歷 /// </summary> /// <param name="tree"></param> public static void PostOrder(BinaryTreeNode tree) { if (tree == null) return; PostOrder(tree.left); PostOrder(tree.right); System.Console.Write(tree.value + " "); } /// <summary> /// 后序遍歷循環(huán)實現(xiàn)1 /// </summary> /// <param name="tree"></param> public static void PostOrderLoop(BinaryTreeNode tree) { if (tree == null) return; Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; BinaryTreeNode pre = null; stack.Push(node); while (stack.Any()) { node = stack.Peek(); if ((node.left == null && node.right == null) || (pre != null && (pre == node.left || pre == node.right))) { System.Console.Write(node.value + " "); pre = node; stack.Pop(); } else { if (node.right != null) stack.Push(node.right); if (node.left != null) stack.Push(node.left); } } } /// <summary> /// 后續(xù)遍歷循環(huán)實現(xiàn)2 /// </summary> /// <param name="tree"></param> public static void PostOrderLoop2(BinaryTreeNode tree) { HashSet<BinaryTreeNode> visited = new HashSet<BinaryTreeNode>(); Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>(); BinaryTreeNode node = tree; while (node != null || stack.Any()) { if (node != null) { stack.Push(node); node = node.left; } else { var item = stack.Peek(); if (item.right != null && !visited.Contains(item.right)) { node = item.right; } else { System.Console.Write(item.value + " "); visited.Add(item); stack.Pop(); } } } } }
創(chuàng)新互聯(lián)www.cdcxhl.cn,專業(yè)提供香港、美國云服務(wù)器,動態(tài)BGP最優(yōu)骨干路由自動選擇,持續(xù)穩(wěn)定高效的網(wǎng)絡(luò)助力業(yè)務(wù)部署。公司持有工信部辦法的idc、isp許可證, 機房獨有T級流量清洗系統(tǒng)配攻擊溯源,準(zhǔn)確進行流量調(diào)度,確保服務(wù)器高可用性。佳節(jié)活動現(xiàn)已開啟,新人活動云服務(wù)器買多久送多久。
新聞標(biāo)題:C#實現(xiàn)二叉樹的遍歷-創(chuàng)新互聯(lián)
轉(zhuǎn)載來于:http://muchs.cn/article8/degiop.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供企業(yè)建站、電子商務(wù)、品牌網(wǎng)站制作、移動網(wǎng)站建設(shè)、域名注冊、網(wǎng)站營銷
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請盡快告知,我們將會在第一時間刪除。文章觀點不代表本網(wǎng)站立場,如需處理請聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時需注明來源: 創(chuàng)新互聯(lián)
猜你還喜歡下面的內(nèi)容