解题思路:
注意事项:
参考代码:
#include<iostream> using namespace std; string s; struct BiTreeNode{ char val; BiTreeNode *left,*right; BiTreeNode(char _val):val(_val),left(NULL),right(NULL){} }*root; int num=-1; void createTree(BiTreeNode* &root) { num++; if(num==s.size()) return; if(s[num]==' ') return; root=new BiTreeNode(s[num]); createTree(root->left); createTree(root->right); } void preorder(BiTreeNode* root) { if(!root) return; cout<<root->val<<" "; preorder(root->left); preorder(root->right); } void midorder(BiTreeNode* root) { if(!root) return; midorder(root->left); cout<<root->val<<" "; midorder(root->right); } int main() { getline(cin,s); createTree(root); preorder(root); cout<<endl; midorder(root); cout<<endl; midorder(root); return 0; }
0.0分
0 人评分