High-performance tidy trees visualization
This article introduces the algorithm to draw non-layered trees in linear time and re-layout partially when some nodes change in O(d) time, where d is the maximum depth of the changed node.
Source: zxch3n.com