生成一棵具有关键字从1到2的(H+1)次方-1且高为H的理想二叉搜索树C语言

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