Adding Edges for a Simple Path to a Level of a Complete Binary Tree Maximizing Total Shortening Path Length

摘要

This study proposes a model of adding edges of forming a simple path to a level of depth N in a complete binary tree of height H under giving priority to edges between two nodes of which the deepest common ancestor is deeper. An optimal depth N is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes in the complete binary tree.