The main concerns of host-based multicast tree construction algorithm are to minimize the network resource utilization and to meet the need of application programs such as Internet broadcasting or video conferencing. Existing works focused on reducing performance-degrading factors like the duplicate data transmission on the same network link and overhead incurred at host or end-systems. However, they had relatively high RDP (relative delay penalty), which made it difficult to apply such application programs. In this work, we propose a DDTA (data delivery tree adjust) algorithm which can reduce RDP by minimizing the tree depth and finding suitable intermediate node using node-switching. It also suggests schemes for rapid recovery of a data delivery tree. Simulation results show that RDP of proposed scheme is lower than existing work with minimal performance corruption.