A general rooted tree drawing algorithm

A general rooted tree drawing algorithm is designed in this paper. It satisfies the basic aesthetic criteria and can be well applied to binary trees. Given an area, any complex tree can be drawn within the area in users' favorite styles. The algorithm is efficient with O(LxNxlogN) time complexity and self-adaptive as well.