Myujth

The intent of my code is import treeNodes from an array. The problem with this is that even though I made sure to set root->left and root->right as NULL when I create new treeNodes.

When I traverse the tree and end up at the tree's leaves, the left and right members are still NOT NULL.

treeNode* import_treeNode(treeNode* root, int nodes, int curr_i, int size)
 if (curr_i < size)
 treeNode* newNode = new treeNode;
 root = newNode;
 root->value = nodes[curr_i];
 if (2 * curr_i + 1 < size)
 root->left = import_treeNode(root->left, nodes, 2 * curr_i + 1, size);
 else 
 root->left = NULL;
 
 if (2 * curr_i + 2 < size)
 root->right = import_treeNode(root->right, nodes, 2 * curr_i + 2, size);
 else 
 root->right = NULL;
 
 return root;
 else 
 return NULL;
 

When you assign to the root:

root = newNode;

You are losing the root node that is passed to the function. So for example here:

root->left = import_treeNode(root->left, nodes, 2 * curr_i + 1, size);

The root-left that you pass to the recursive call in not valid.

Perhaps you can use the newNode throughout the function instead of assigning it to the root and using the root.