#include using namespace std; struct S_DECITION_NODE_DATA { S_DECITION_NODE_DATA(){ ID = Count++;}; ~S_DECITION_NODE_DATA(){}; static int Count; int ID; int Costs; bool Is_visited; bool Is_leaf; }; int S_DECITION_NODE_DATA::Count =0; struct S_DECITION_NODE { S_DECITION_NODE(){}; ~S_DECITION_NODE(){}; S_DECITION_NODE *BRANCH_1; S_DECITION_NODE *BRANCH_2; S_DECITION_NODE *BRANCH_3; S_DECITION_NODE *BRANCH_4; S_DECITION_NODE_DATA DATA; static S_DECITION_NODE* newNode(S_DECITION_NODE_DATA data){ S_DECITION_NODE *newnode = new S_DECITION_NODE(); newnode->DATA = data; return newnode;// } }; class S_DECITION_TREE { public: S_DECITION_TREE(){}; S_DECITION_TREE(S_DECITION_NODE *&_m_root):m_root(_m_root){}; ~S_DECITION_TREE(){}; S_DECITION_NODE *m_root; S_DECITION_NODE_DATA m_arr_root_data[999]; void TraverseLevelOrder(S_DECITION_NODE *m_root){ if(!m_root) return; cout << m_root->DATA.ID; // if(m_root->BRANCH_1) cout << m_root->BRANCH_1->DATA.ID; // if(m_root->BRANCH_2) cout << m_root->BRANCH_2->DATA.ID; // if(m_root->BRANCH_3) cout << m_root->BRANCH_3->DATA.ID; // if(m_root->BRANCH_4) cout << m_root->BRANCH_3->DATA.ID; //TraverseLevelOrder(S_DECITION_NODE *m_root) }; void TraverseInOrder(); void TraversePreOrder(S_DECITION_NODE *m_root) { if(!m_root) return; cout << m_root->DATA.ID; TraverseLevelOrder(m_root->BRANCH_1); TraverseLevelOrder(m_root->BRANCH_2); TraverseLevelOrder(m_root->BRANCH_3); TraverseLevelOrder(m_root->BRANCH_4); } void TraversePostOrder(); }; int main() { S_DECITION_NODE_DATA nodeData; S_DECITION_NODE *myNode = S_DECITION_NODE::newNode(nodeData); S_DECITION_NODE_DATA nodeData2; myNode->BRANCH_1 = S_DECITION_NODE::newNode(nodeData2); S_DECITION_NODE_DATA nodeData3; myNode->BRANCH_2 = S_DECITION_NODE::newNode(nodeData3); S_DECITION_TREE myTree(myNode); cout <<"the node is: "<

tree decitions