print all the between values of a tree

[momotaro]

our teacher gave as this function that normaly should print all the between values of a tree given two values min and max but i dont get it right whene appliying the agorithm of this function on a binary search tree...what is wrong?

void PrintRange(TreeNode *root, KeyType KeyMin, KeyType KeyMax){
if (!root)
    return;
else{
    if (root->entry > KeyMin)
        PrintRange(root->left, KeyMin, KeyMax);
    if (root->entry >= KeyMin && root->etry <= KeyMax)
        printf("%d", root->entry);
    if (root->entry < KeyMax)
        PrintRange(root->right, KeyMin, KeyMax);
    }
}

[huan]

our teacher gave as this function that normaly should print all the between values of a tree given two values min and max but i dont get it right whene appliying the agorithm of this function on a binary search tree...what is wrong?

void PrintRange(TreeNode *root, KeyType KeyMin, KeyType KeyMax){
if (!root)
    return;
else{
    if (root->entry > KeyMin)
        PrintRange(root->left, KeyMin, KeyMax);
    if (root->entry >= KeyMin && root->etry <= KeyMax)
        printf("%d", root->entry);
    if (root->entry < KeyMax)
        PrintRange(root->right, KeyMin, KeyMax);
    }
}

are those codes copied or you typed again?
In the second if expression , "etry" should be "entry".
If I didn't misunderstand your purpose.
I think you should keep printing their leaves all.
Not just root->entry, you have to go on.
Am I right?