C——数组元素的二叉树创建

int main() {
    char c[] = "ABCDEFGHIJ";
    pTreeNode_t pArr[MAX_SIZE_OF_TREE];
    for (int i = 0; i < MAX_SIZE_OF_TREE; i++) {
        pArr[i] = (pTreeNode_t)calloc(1, sizeof(TreeNode_t));
        pArr[i]->val = c[i];
    }
    //将左子数和右子数树连到根,index_link_to指现在需要连接的父节点，index_going指正在遍历的节点作子节点
    //index_link_to        0A        1B        ……
    //左索引            1B        3D
    //右索引            2C        4E
    for (int index_link_to = 0, index_going = 1; index_going < MAX_SIZE_OF_TREE; index_going++) {
        if (pArr[index_link_to]->pLeft == NULL) {
            pArr[index_link_to]->pLeft = pArr[index_going];
        }
        else {
            pArr[index_link_to]->pRight = pArr[index_going];
            index_link_to++;
        }
    }

    return 0;
}