i am trying to build a balanced binary tree with the root has the biggest frequency for the getting minimum access time. the formula for the access time is (depth level +1)*
