二叉樹遍歷-遞歸
- 前序遍歷(Pre-Order)
- 中序遍歷(In-Order)
- 後序遍歷(Post-Order)
前序遍歷
//c++:前序遍歷
void preOrder(TreeNode *root){
if (root == NULL) return;
cout<<root->val<<endl;
preOrder(root->left);
preOrder(root->right);
}
中序遍歷
//c++:中序遍歷
void inOrder(TreeNode *root){
if (root == NULL) return;
inOrder(root->left);
cout<<root->val<<endl;
inOrder(root->right);
}
後序遍歷
//c++:後序遍歷
void postOrder(TreeNode *root){
if (root == NULL) return;
postOrder(root->left);
postOrder(root->right);
cout<<root->val<<endl;
}