C++博客-c++-随笔分类-数据结构程序

树的非递归算法（第一次用手写的代码）

陈显锋 — Wed, 21 Apr 2010 13:01:00 GMT

#ifndef BINARY_TREE
#define BINARY_TREE
#include<stack>
#include<iostream>
using namespace std;
template<class T> class BinaryTree;
template<class T>
class BTNode
{
public:
    BTNode(){lChild=rChild=NULL;}
    BTNode(const T&x)
    {
        element=x;
        lChild=rChild=NULL;
    }
    BTNode(const T& x,BTNode<T>*l,BTNode<T>* r)
    {
        element=x;lChild=l;rChild=r;
    }
    friend class BinaryTree<T>;
private:
    T element;
    BTNode<T>* lChild,*rChild;
    static stack<BTNode<T>*> s;
};
template<class T>
stack<BTNode<T>*> BTNode<T>::s;

template<class T>
class BinaryTree
{
public:
    BinaryTree(){root=NULL;}
    bool IsEmpty()const{return root==NULL}
    void Clear();
    bool Root(T& x)const;
    void MakeTree(const T& x,BinaryTree<T>& left,BinaryTree<T>& right);
    void BreakTree(T& x,BinaryTree<T>& left,BinaryTree<T>& right);
    void PreOrder();
protected:
    BTNode<T>* root;
private:
    void PreOrder(BTNode<T>*current);
};

#endif//BINARY_TREE

template<class T>
bool BinaryTree<T>::Root(T &x)const
{
    if(root){
        x=root->element;return true;
    }
    else return false;
}

template<class T>
void BinaryTree<T>::MakeTree(const T& x,BinaryTree<T>& left,BinaryTree<T>& right)
{
    if(root||&left==&right) return;
    root=new BTNode<T>(x,left.root,right.root);
    left.root=right.root=NULL;
}

template<class T>
void BinaryTree<T>::BreakTree(T& x,BinaryTree<T>& left,BinaryTree<T>& right)
{
    if(root||&left==&right||left.root==right.root) return;
    x=root->element;
    left.root=root->lChild;right.root=root->rChild;
    delete root;root=NULL;//
}

template<class T>
void BinaryTree<T>::PreOrder(BTNode<T>* current)
{
loop:
    while(current){
        Visit(current->element);
        if(current->rChild)
            BTNode<T>::s.push(current->rChild);
        current=current->lChild;
    }
    current=BTNode<T>::s.top();Visit(current->element);BTNode<T>::s.pop();
    if(BTNode<T>::s.empty()) return;
    else goto loop;
}

template<class T>
void BinaryTree<T>::PreOrder()
{
    if(root)
        PreOrder(root);
    if(root->rChild)
        PreOrder(root->rChild);
}

陈显锋 2010-04-21 21:01 发表评论

自己编的计算器类（使用自定义链式栈）

陈显锋 — Sat, 17 Apr 2010 04:11:00 GMT

摘要: #ifndef LINKEDSTACK_CLASS#define LINKEDSTACK_CLASStemplate class LinkedStack;template class Node{ &... 阅读全文

陈显锋 2010-04-17 12:11 发表评论

链式栈及用其测试的计算器

陈显锋 — Sat, 17 Apr 2010 02:59:00 GMT

摘要: #ifndef STACK_CLASS#define STACK_CLASS#includeusing namespace std;template class Stack{public: virtual boo... 阅读全文

陈显锋 2010-04-17 10:59 发表评论

编写用链表实现的多项式的加法和乘法运算

陈显锋 — Wed, 14 Apr 2010 13:11:00 GMT

摘要: #ifndef POLYNOMINAL_CLASS#define POLYNOMINAL_CLASS#includeusing namespace std;class Term{private: int coef; &nbs... 阅读全文

陈显锋 2010-04-14 21:11 发表评论

初次使用栈编写的计算器

陈显锋 — Wed, 14 Apr 2010 13:06:00 GMT

1#include<iostream>
2#include<stack>
3#include<math.h>
4using namespace std;
5#include<ctype.h>
6
7stack<float> s;
8stack<char> cs;
9
10int isp(char optr)
11{
12    switch (optr)
13    {
14    case '=': return 0;
15    case '(': return 1;
16    case '^': return 7;
17    case '*': return 5;
18    case '/': return 5;
19    case '%': return 5;
20    case '+': return 3;
21    case '-': return 3;
22    case ')': return 8;
23    default: return 0;
24    }
25}
26
27int icp(char optr)
28{
29    switch (optr)
30    {
31    case '=': return 0;
32    case '(': return 8;
33    case '^': return 6;
34    case '*': return 4;
35    case '/': return 4;
36    case '%': return 4;
37    case '+': return 2;
38    case '-': return 2;
39    case ')': return 1;
40    default: return 0;
41    }
42}
43
44
45void DoOperator(char oper)
46{
47    float oper1,oper2;
48    oper1=s.top();
49    s.pop();
50    oper2=s.top();
51    s.pop();
52    switch(oper)
53    {
54        case '+':s.push(oper2+oper1);break;
55        case '-':s.push(oper2-oper1);break;
56        case '*':s.push(oper2*oper1);break;
57        case '/':s.push(oper2/oper1);break;
58        case '^':s.push(pow(oper2,oper1));break;
59    }
60}
61
62void Run()
63{
64    char c;float newop;char y;
65    cs.push('=');
66    while(cin>>c,c!='='){
67        //if(c!='+'&&c!='-'&&c!='*'&&c!='/')
68        if(isdigit(c)||isalpha(c))
69        {
70            cin.putback(c);cin>>newop;
71            s.push(newop);
72        }
73        else if(c==')')
74            for(y=cs.top(),cs.pop();y!='(';y=cs.top(),cs.pop())
75                DoOperator(y);
76        else
77        {
78            for(y=cs.top(),cs.pop();icp(c)<=isp(y);y=cs.top(),cs.pop())
79                DoOperator(y);
80            cs.push(y);cs.push(c);
81        }
82    }
83    while(!cs.empty()){
84        y=cs.top();
85        cs.pop();
86        if(y!='=')
87            DoOperator(y);
88    }
89    cout<<s.top();
90}
91
92int main()
93{
94    Run();
95}
96

陈显锋 2010-04-14 21:06 发表评论