A simple demo for tree auto layout
Algorithm
Given a tree structure \(T, h_{\text{margin}}, v_{\text{margin}}\). First, we start indexing each node of the tree with following rules:
Traverse \(T\) using Depth-First-Search (DFS)
The first child of a node has same index with its paren...
