根据二叉树的中序遍历和后序遍历创建 一棵二叉树,并且返回所创建的树的树高,具体方法请参见下面源码(经过调试,无任何bug存在)
#includeusing namespace std;class Node {public: char ch; Node*left; Node *right; Node(char c, Node *lc, Node *rc) { ch = c; left = lc; right = rc; } Node() { } ~Node() { delete left; delete right
原创
2014-12-23 22:13:08 ·
466 阅读 ·
0 评论