编写 C 代码以在二叉树上执行按顺序遍历 -

void in-order(struct treenode *tree){  
    if(tree != NULL)  
    {  
        in-order(tree→ left);  
        printf("%d",tree→ root);  
        in-order(tree→ right);  
    }  
}