[二叉树的分层遍历] 倒序的树

#include <iostream>
#include <stack>

struct TreeNode
{
    char data;
    TreeNode* leftChd;
    TreeNode* rightChd;
};

std::stack<TreeNode*> nodeStack;

void printTree(TreeNode* node)
{
    nodeStack.push(node);
    //std::cout << node->data << std::endl;
    if(node->rightChd != NULL)
    {
        printTree(node->rightChd);
    }
    if(node->leftChd != NULL)
    {
        printTree(node->leftChd);
    }
}

void printStack(std::stack<TreeNode*> test)
{
    while(test.size() != 0)
    {
        std::cout << test.top()->data << std::endl;
        test.pop();
    }
}

int main(int argc, const char * argv[])
{
    TreeNode *a = new TreeNode;
    a->TreeNode::data = ‘A‘;
    TreeNode *b = new TreeNode;
    b->TreeNode::data = ‘B‘;
    TreeNode *c = new TreeNode;
    c->TreeNode::data = ‘C‘;
    TreeNode *d = new TreeNode;
    d->TreeNode::data = ‘D‘;
    TreeNode *e = new TreeNode;
    e->TreeNode::data = ‘E‘;
    TreeNode *f = new TreeNode;
    f->TreeNode::data = ‘F‘;
    a->leftChd = b;
    a->rightChd = c;
    b->leftChd = d;
    c->leftChd = e;
    c->rightChd =f;
    std::cout << "Hello, MAC!\n";
    printTree(a);
    printStack(nodeStack);
    return 0;
}