Printing from the tree using recursion....PLZ HELP!

[momotaro]

am trying to impliment a function which print the keys from a binary tree in the bracketed form (key : left, right) where key is the key in the root, left denotes the left subtree of the root printed in bracketed form, and right denotes the right subtree in bracketed form


********************************Here is my function ******************************

void PrintKeys(Tree *root){
if (root){
           printf("%d" : ,root ->entry);
           PrintKeys(Tree -> left);
           printf(", ");
           PrintKey(root -> right);
          }
}

PS:if is there any better implimentation feel free :)

THX!

[Ganon11]

That looks just fine to me.