描述二叉树的二叉链表表示的储存结构,并给出中序遍历二叉树的算法?

struct BinaryNode {
int value;

BinaryNode * leftChild;

BinaryNode * rightChild;

};

void inOrder (BinaryNode * root) {
if (root != NULL) {
if (root -> leftChild != NULL) {
inOrder (root -> leftChild);

}

//visit the root

if (root -> rightChild != NULL) {
inOrder (root -> rightChild);

}

}

return;
}