數(shù)據(jù)結(jié)構(gòu)算法
二叉樹的遍歷
//先序遍歷
void preorder(TreeNode * root)
{
if root==null
return;
cout<<root.val<<endl;
preorder(root.left);
preorder(root.right);
}
//中序遍歷
void inorder(TreeNode *root)
{
if root==null
return;
inorder(root.left);
cout<<root.val;
inorder(root.right);
}
//后序遍歷
void postoder(TreeNode *root)
{
if root==null
return;
inorder(root.left);
inorder(root.right);
cout<<root.val;
}
