Order-preserving, upward drawing of binary trees using fewer bends Original Research Article

For a binary tree with n nodes, we present a planar, polyline, order-preserving, upward, grid drawing that has O(n/log n) bends and matches the previously best area O(n log n). This is an improvement over the O(n log n) area drawing, which has O(n) bends.