Should array indices start at 0 or 1? My compromise of 0.5 was rejected without, I thought, proper consideration. Stan Kelly-Bootle

Optimal Binary search tree

Language Java | Level Intermediate | Category Algorithms | August 4, 2015 9:02 am


Algorithm Problem Description

Optimal binary search tree can be static or dynamic. The tree cannot be modified in static optimality. The tree can be modified any time in the dynamic optimality. The tree can be rotated in the dynamic problem. Binary search tree is a binary search tree which provides the smallest possible search time for a given sequence of accesses.

Write a program to implement optimal binary search tree

Output

          	        
          	        
Number of identifiers: 3
Identifiers: [null, 1, 2, 3, null]
Success probability for identifiers: [0, 4, 5, 6, 0]
Failure probability for identifiers: [6, 7, 8, 9, 0]
Tree in pre order: 2 1 3          	        
          	        				    


Comments



Please login to add comments.