学步园

Tree generate_ideal_binary_search_tree (const int height, int * const assigned_min)<br /> {<br /> Tree tree ;</p> <p> if (height >= 0)<br /> {<br /> tree = (Node *) malloc (sizeof (Node)) ;<br /> tree -> left = generate_ideal_binary_search_tree (height - 1, assigned_min) ;<br /> tree -> item = (*assigned_min)++ ;<br /> tree -> right = generate_ideal_binary_search_tree (height - 1, assigned_min) ;<br /> return tree ;<br /> }<br /> else<br /> return NULL ;<br /> }