数据结构
struct TreeNode{
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x){
val(x), left(NULL), right(NULL)
};
}
前序遍历
中序遍历
后序遍历
层次遍历
void levelOrder(TreeNode *root){
if(root){
queue<TreeNode *> q;
TreeNode *p = NULL;//一定要初始化为NULL,否则要出错
q.push(root);
while(q){
p = q.front();
cout<<p->val<<" ";
q.pop();
if(p->left) q.push(p->left);
if(p->right) q.push(p->right);
}
}
}