C++ (Cpp) optimalSearchTree Examples

Example #1

File: Optimal BST.cpp Project: TiwariAnil/Algorithmic_Puzzles

// Driver program to test above functions
int main()
{
    int keys[] = {1, 2, 3,4,5,6,7};
    int freq[] = {5,40,8,4,10,10,23};
    int n = sizeof(keys)/sizeof(keys[0]);
    printf("Cost of Optimal BST is %d ", optimalSearchTree(keys, freq, n));
    return 0;
}

Example #2

File: obst.c Project: luancmenezes/analise

int main() {
  int i, k,n;
  obst *arvore;

     scanf("%d", &n);
		for(i = 1; i <= n; ++i) {
             scanf("%d", &keys[i]);
       }
		for(i = 1; i <= n; ++i){
			scanf("%d",&freq[i]);
		}
       for(i = 0; i <= n; i++) {
             scanf("%d",&q[i]);
       }

	    optimalSearchTree(n);
	    arvore = CONSTRUCT_obst(0,n);
      constroi_avore_otima(arvore);
      printf("chave: d%d fesq: nil fdir: nil\n", d);
   return 0;
}