joowani / binarytree

100%

LAST BUILD ON BRANCH master

branch: master

CHANGE BRANCH

x

Reset

• master
• 1.0
• 1.1
• 1.1.1
• 2.0.0
• 2.0.1
• 3.0.0
• 3.0.1
• 4.0.0
• 4.1.0
• 5.0.0
• 5.1.0
• dev
• development
• main

Implement svg output in notebooks

This implementation use a simple algorithm in which the layout used is
based on a perfect tree of same height in which all leaves would be
regularly spaced.

This approach is ok for little trees to about 4 levels but for larger trees
with holes a better approach would be to implement the Reingold &
Tilford’s algorithm.