数据结构实践——用二叉树求解代数表达式

最新推荐文章于 2022-01-22 18:10:24 发布

maranran_dream

最新推荐文章于 2022-01-22 18:10:24 发布

阅读量1.3k

点赞数

【项目 - 用二叉树求解代数表达式】
　　用二叉树来表示代数表达式，树的每一个分支节点代表一个运算符，每一个叶子节点代表一个运算数（为简化，只支持二目运算的+、-、*、/，不加括号，运算数也只是一位的数字字符。本项目只考虑输入合乎以上规则的情况）。请设计算法，（1）根据形如“ 1+2∗3−4/5 ”的字符串代表的表达式，构造出对应的二叉树（如图），用后序遍历的思路计算表达式的值时，能体现出先乘除后加减的规则；（2）对构造出的二叉树，计算出表达式的值。
这里写图片描述

[参考解答] 程序中的btree.h，见二叉树算法库。

<code class="hljs cpp has-numbering" style="display: block; padding: 0px; color: inherit; box-sizing: border-box; font-family: 'Source Code Pro', monospace;font-size:undefined; white-space: pre; border-radius: 0px; word-wrap: normal; background: transparent;"><span class="hljs-preprocessor" style="color: rgb(68, 68, 68); box-sizing: border-box;">#include <stdio.h></span>
<span class="hljs-preprocessor" style="color: rgb(68, 68, 68); box-sizing: border-box;">#include <string.h></span>
<span class="hljs-preprocessor" style="color: rgb(68, 68, 68); box-sizing: border-box;">#include <malloc.h></span>
<span class="hljs-preprocessor" style="color: rgb(68, 68, 68); box-sizing: border-box;">#include "btree.h"</span>

<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//用s[i]到s[j]之间的字符串，构造二叉树的表示形式</span>
BTNode *CRTree(<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">char</span> s[],<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> i,<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> j)
{
    BTNode *p;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> k,plus=<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>,posi;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (i==j)    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//i和j相同，意味着只有一个字符，构造的是一个叶子节点</span>
    {
        p=(BTNode *)<span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">malloc</span>(<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">sizeof</span>(BTNode));   <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//分配存储空间</span>
        p->data=s[i];                         <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//值为s[i]</span>
        p->lchild=NULL;
        p->rchild=NULL;
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> p;
    }
    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//以下为i!=j的情况</span>
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">for</span> (k=i; k<=j; k++)
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (s[k]==<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'+'</span> || s[k]==<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'-'</span>)
        {
            plus++;
            posi=k;              <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//最后一个+或-的位置</span>
        }
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (plus==<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>)                 <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//没有+或-的情况(因为若有+、-，前面必会执行plus++)</span>
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">for</span> (k=i; k<=j; k++)
            <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (s[k]==<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'*'</span> || s[k]==<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'/'</span>)
            {
                plus++;
                posi=k;
            }
    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//以上的处理考虑了优先将+、-放到二叉树较高的层次上</span>
    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//由于将来计算时，运用的是后序遍历的思路</span>
    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//处于较低层的乘除会优先运算</span>
    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//从而体现了“先乘除后加减”的运算法则</span>
    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//创建一个分支节点，用检测到的运算符作为节点值</span>
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (plus!=<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>)
    {
        p=(BTNode *)<span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">malloc</span>(<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">sizeof</span>(BTNode));
        p->data=s[posi];                <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//节点值是s[posi]</span>
        p->lchild=CRTree(s,i,posi-<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">1</span>);   <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//左子树由s[i]至s[posi-1]构成</span>
        p->rchild=CRTree(s,posi+<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">1</span>,j);   <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//右子树由s[poso+1]到s[j]构成</span>
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> p;
    }
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">else</span>       <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//若没有任何运算符，返回NULL</span>
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> NULL;
}

<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">double</span> Comp(BTNode *b)
{
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">double</span> v1,v2;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (b==NULL)
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> <span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (b->lchild==NULL && b->rchild==NULL)  <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//叶子节点，应该是一个数字字符（本项目未考虑非法表达式）</span>
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> b->data-<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'0'</span>;    <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//叶子节点直接返回节点值，结点中保存的数字用的是字符形式，所以要-'0'</span>
    v1=Comp(b->lchild); <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//先计算左子树</span>
    v2=Comp(b->rchild); <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//再计算右子树</span>
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">switch</span>(b->data)     <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//将左、右子树运算的结果再进行运算，运用的是后序遍历的思路</span>
    {
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">case</span> <span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'+'</span>:
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> v1+v2;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">case</span> <span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'-'</span>:
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> v1-v2;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">case</span> <span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'*'</span>:
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> v1*v2;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">case</span> <span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">'/'</span>:
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">if</span> (v2!=<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>)
            <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> v1/v2;
        <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">else</span>
            <span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">abort</span>();
    }
}

<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> main()
{
    BTNode *b;
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">char</span> s[MaxSize]=<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">"1+2*3-4/5"</span>;
    <span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">printf</span>(<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">"代数表达式%s\n"</span>,s);
    b=CRTree(s,<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>,<span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">strlen</span>(s)-<span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">1</span>);
    <span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">printf</span>(<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">"对应二叉树:"</span>);
    DispBTNode(b);
    <span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">printf</span>(<span class="hljs-string" style="color: rgb(0, 136, 0); box-sizing: border-box;">"\n表达式的值:%g\n"</span>,Comp(b));
    DestroyBTNode(b);
    <span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">return</span> <span class="hljs-number" style="color: rgb(0, 102, 102); box-sizing: border-box;">0</span>;
}
</code><div>
</div>