由字符串建立二叉树

 

1. /*  由字符串建立二叉树*/
2. #include <iostream>
3. #include <string>
4. #include <stack>
5. #include <stdlib.h>
6. using namespace std;
8. typedef struct Tree_Node{
9.        char value;
10.        struct Tree_Node *lchild;
11.        struct Tree_Node *rchild;
12.        }Node,*Tree;
14. void In_Order(Tree t)
15. {
16.      if(!t) return;
17.      In_Order(t->lchild);
18.      cout<<(t->value);
19.      In_Order(t->rchild);
20. }
21.      
22. Tree Build_Tree(string expr)
23. {
24.     
25.      int i=0,flag=1;
26.      stack<Tree> e;
27.      stack<char> s;
28.      Tree  t=(Tree) malloc(sizeof(Node));
29.      t->value=expr[i];
30.      t->lchild=NULL;
31.      t->rchild=NULL;
32.      Tree p=t;
33.      i++;
34.      while(expr[i]!='/0')
35.      {
36.          switch (expr[i]) 
37.          {    
38.               case '(':
39.                    s.push(expr[i]);
40.                    e.push(p);
41.                    i++;
42.                    flag=1;
43.                    break;
44.               case ')':
45.                    s.pop();
46.                    e.pop();
47.                    i++;
48.                    break;
49.               case ',':
50.                    flag=0;
51.                    i++;
52.                    break;
53.               default:
54.                    Tree q=(Tree) malloc(sizeof(Node));
55.                    q->value=expr[i];
56.                    q->lchild=NULL;
57.                    q->rchild=NULL;
58.                    p=e.top();
59.                    if(flag)
60.                    {
61.                         p->lchild=q;
62.                    }
63.                    else
64.                    {
65.                        p->rchild=q;
66.                    }
67.                    p=q;
68.                    i++;
69.                             
70.          }
71.      }
72.      return t;
73. } 
76.      
77. int main()
78. {
79.     string expr="A(B(D,E),C(F))";
80.     Tree t=Build_Tree(expr);
81.     In_Order(t);
82.     system("pause");
83. }