Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree

This paper proposes a model of placing a liaison which forms relations to two members of the same level in a pyramid organization structure such that the communication of information between every member in the organization becomes the most efficient. For the model of adding a node of liaison which gets adjacent to two nodes with the same depth N in a complete binary tree of height H which can describe the basic type of a pyramid organization, we obtained an optimal depth N* which maximizes the sum of shortening lengths of shortest paths between every pair of all nodes.