使用 C 中的顺序横向将树数据结构存储到数组

Question

I am trying to write a code to transverse a tree data structure using inorder transversal and store each node onto an array.

I came up with this code below to achieve it, please correct me if the code is wrong. Even if this is correct, there must be better ways of doing this than using 'static' which makes 'index' stayed in the memory until the program finishes.

void *inorderTransversal(AVLTreeNode *node, int treeSize)
{
    static int index = 0;
    AVLTreeNode *nodesArray[treeSize-1]; 
    if (node == NULL)
        return;

    inorderTransversal(node->left, treeSize);
    nodesArray[index] = node;
    index++;
    inorderTransversal(node->right, treeSize);
}

Answer 1

You can declare an array based on tree size and store it.

int[treeSize] array = new int[treeSize]; 
int index = 0; 
void *inorderTransversal(AVLTreeNode *node) { 
    if (node == null) 
        return; 
    inorderTransversal(node->left); 
    array[index++] = node.value; 
    inorderTransversal(node->right); 
}