binarytree.hpp

浏览该文件的文档.

#pragma once
#include <queue>
 
namespace NANA {
namespace GRAPH {
 
template<typename T>
struct BinTreeNode
{
    T data;
    BinTreeNode<T>* leftChild;
    BinTreeNode<T>* rightChild;
    BinTreeNode() :
        leftChild(nullptr),
        rightChild(nullptr) {
    }
    BinTreeNode(T x, BinTreeNode<T>* l = nullptr, BinTreeNode<T>* r = nullptr) :
        data(x),
        leftChild(l),
        rightChild(r) {
    }
};
 
 
template<typename T>
void PreOrder(BinTreeNode<T>* node,std::queue<T> & curQueue)
{
    if (nullptr == node)
        return;
 
    curQueue.push(node->data);
    PreOrder(node->leftChild, curQueue);
    PreOrder(node->rightChild, curQueue);
    
}
 
template<typename T>
void InOrder(BinTreeNode<T>* node, std::queue<T>& curQueue)
{
    if (nullptr == node)
        return;
 
    InOrder(node->leftChild, curQueue);
    curQueue.push(node->data);
    InOrder(node->rightChild, curQueue);
    
}
 
 
template<typename T>
void PostOrder(BinTreeNode<T>* node, std::queue<T>& curQueue)
{
    if (nullptr == node)
        return;
    PostOrder(node->leftChild, curQueue);
    PostOrder(node->rightChild, curQueue);
    curQueue.push(node->data);
    
}
 
 
 
template<typename _T>
class CBinaryTree {
 
public:
    CBinaryTree() :
        m_root(nullptr) {
 
    }
 
    bool empty() {
        if (nullptr == m_root)
            return true;
        return false;
    }
    
    static int maxDepth(BinTreeNode<T>* root) {
        if (nullptr == root)
            return 0;
        int left = maxDepth(root->leftChild) + 1;
        int right = maxDepth(root->rightChild) + 1;
        return std::max(left, right);
    }
 
protected:
    BinTreeNode<T>* m_root; 
 
 
};
 
 
 
}
}