算法导论 练习题 10.4-4

void trav(TreeNode t)

{

if(t == null)

return;

print(t->key);

TreeNode tn=t->leftChild;

trav(tn);

if(tn != null)

trav(tn->rightSibling);

}