computation of topological indices of binary and ternary trees using algorithmic approach

In this paper‎, ‎algorithms are used to compute distance-based topological indices for the complete binary tree (cbt) and the complete ternary tree (ctt)‎. ‎computation of distance-based topological indices is complex for varied heights of cbt and ctt‎. ‎hence designed algorithms to compute distance between any-to-any vertex made this possible to compute the required topological indices for cbt and ctt‎. ‎the distance calculator algorithm designed for this study can also be customized in digital chemical structures‎, ‎mathematical chemistry‎, ‎network traffic control in wireless networks‎, ‎search applications‎, ‎high bandwidth routing‎, ‎parse construction in compilers‎, ‎and memory management.