本帖子已过去太久远了，不再提供回复功能。用先序和中序建立二叉树【c语言吧】_百度贴吧
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&签到排名：今日本吧第个签到，本吧因你更精彩，明天继续来努力！
本吧签到人数：0成为超级会员，使用一键签到本月漏签0次！成为超级会员，赠送8张补签卡连续签到：天&&累计签到：天超级会员单次开通12个月以上，赠送连续签到卡3张
关注：533,386贴子：
用先序和中序建立二叉树收藏
用先序和中序建立二叉树
c语言-达内课程学习,O基础学起只需4-16周便能掌握,适合高中以上初学者!达内培训c语言,O元试学学C语言,,高中以上,学习0压力!
你真的懂 什么是先序 中序吗
先序中序是遍历的两种方法，你的意思是不是用两种遍历序列重组二叉树？
方法就是下面这样（均是迭代版）：***********************************************************************************************************************************/// &summary&/// 中序遍历，以左子树优先，根节点次之，右子树最后的访问顺序遍历二叉树。/// &/summary&/// &param name=&item&&起始节点，遍历将从该项开始。&/param&/// &returns&一个 System.Collections.Generic.IEnumerable&BinaryTreeNode&T&&。&/returns&public IEnumerable&BinaryTreeNode&T&& InOrder(BinaryTreeNode&T& item){....Stack&BinaryTreeNode&T&& ordered = new Stack&BinaryTreeNode&T&&();........................................................................................................................................................................while (ordered.Count & 0 || item != null)....{........if (item != null)........{............// Push Current.............ordered.Push(item);................................................................................................................................................................................// Make left Child as Current.............item = item.L........}........else........{............// Pon Current.............item = ordered.Pop();................................................................................................................................................................................// Make right Child as Current.............item = item.R........}....}........................................................................................................................................................................}***********************************************************************************************************************************/// &summary&/// 先序遍历，以根节点优先，左子树次之，右子树最后的访问顺序遍历二叉树。/// &/summary&/// &param name=&item&&起始节点，遍历将从该项开始。&/param&/// &returns&一个 System.Collections.Generic.IEnumerable&BinaryTreeNode&T&&。&/returns&public IEnumerable&BinaryTreeNode&T&& PreOrder(BinaryTreeNode&T& item){....Stack&BinaryTreeNode&T&& ordered = new Stack&BinaryTreeNode&T&&();........................................................................................................................................................................// Push Current.....ordered.Push(item);........................................................................................................................................................................while (ordered.Count & 0)....{........// Pop Current.........item = ordered.Pop();............................................................................................................................................................................// Push Right.........if (item.Right != null)........{............ordered.Push(item.Right);........}............................................................................................................................................................................// Push Left.........if (item.Left != null)........{........ordered.Push(item.Left);........}....}........................................................................................................................................................................}***********************************************************************************************************************************/// &summary&/// 后序遍历，以左子树优先，右子树次之，根节点最后的访问顺序遍历二叉树。/// &/summary&/// &param name=&item&&起始节点，遍历将从该项开始。&/param&/// &returns&一个 System.Collections.Generic.IEnumerable&BinaryTreeNode&T&&。&/returns&public IEnumerable&BinaryTreeNode&T&& PostOrder(BinaryTreeNode&T& item){....Stack&BinaryTreeNode&T&& ordered = new Stack&BinaryTreeNode&T&&();........................................................................................................................................................................BinaryTreeNode&T& peekNode =....BinaryTreeNode&T& lastNodeVisited =........................................................................................................................................................................while (ordered.Count & 0 || item != null)....{........if (item != null)........{............// Push Current.............ordered.Push(item);................................................................................................................................................................................// Make left Child as Current.............item = item.L........}........else........{............// Pop to peekNode.............peekNode = ordered.Peek();................................................................................................................................................................................if (peekNode.Right != null && peekNode.Right != lastNodeVisited)............{................// Make right Child as Current.................item = peekNode.R............}............else............{................// Poh current................ordered.Pop();....................................................................................................................................................................................// Make last visited as peekNode................lastNodeVisited = peekN
}........................................................................................................................................................................}***********************************************************************************************************************************
登录百度帐号推荐应用扫二维码下载作业帮
1.75亿学生的选择
下载作业帮安装包
扫二维码下载作业帮
1.75亿学生的选择
如何根据前序遍历序列和中序遍历序列确定二叉树
扫二维码下载作业帮
1.75亿学生的选择
假设某二叉树的先序遍历序列是abdgcefh,中序遍历序列是dgbaechf,画出二叉树,并给出其后序遍历序列.以下面的例题为例进行讲已知一棵二叉树的先序遍历序列和中序遍历序列分别是abdgcefh、dgbaechf,求二叉树及后序遍历序列.分析：先序遍历序列的第一个字符为根结点.对于中序遍历,根结点在中序遍历序列的中间,左边部分是根结点的左子树的中序遍历序列,右边部分是根结点的右子树的中序遍历序列.先序：abdgcefh --> a bdg cefh中序：dgbaechf --> dgb a echf得出结论：a是树根,a有左子树和右子树,左子树有bdg结点,右子树有cefh结点.先序：bdg --> b dg中序：dgb --> dg b得出结论：b是左子树的根结点,b无右子树,有左子树.先序：dg --> d g中序：dg --> d g得出结论：d是b的左子树的根结点,d无左子树,有右子树.先序：cefh --> c e fh中序：echf --> e c hf得出结论：c是右子树的根结点,c有左子树(只有e结点),有右子树(有fh结点).先序：fh --> f h中序：hf --> h f得出结论：f是c的左子树的根结点,f有左子树(只有h结点),无右子树.还原二叉树为：ab cd e fg h后序遍历序列：gdbehfca
为您推荐：
其他类似问题
扫描下载二维码