Draw binary tree in plain text

Draw tree from level order traversal, '#' signifies a path terminator where no node exists below.

from drawtree import draw_level_order
draw_level_order('{3,9,20,#,#,15,7}')

  3
 / \
9  20
   / \
  15  7

Draw random binary search tree

from drawtree import draw_random_bst
draw_random_bst(10)

    64
    / \
   /   \
  4    66
   \     \
   37    70
   / \
  8  51
 / \
6  12
     \
     21

Draw binary search tree from integer array

from drawtree import draw_bst
nums = [55, 30, 10, 5, 2, 20, 15, 25, 40, 35, 70, 60, 80, 75, 95]
draw_bst(nums)

             55
             / \
            /   \
           /     \
          /       \
         30       70
        / \       / \
       /   \     /   \
      /     \   60   80
     10     40       / \
    / \     /       /   \
   /   \   35      75   95
  5    20
 /     / \
2     /   \
     15   25

Flags:

-p, --preorder	interpet sequence as preorder
-b, --balanced	auto balance bst

-l, --level-order interpet sequence as level-order

Print a bst:

$ bst 10 5 8 4 6
$ bst nodes.txt
$ echo "colin eric dave" | bst
$ cat nodes.txt | sort | uniq | bst

Print a balanced bst:

$ bst -b 10 5 6 9 3
$ bst -b nodes.txt
$ bst -b < nodes.txt

Print a bst from a preorder expression:

$ bst -p dave colin dan
$ echo "1 2 3 4 5" | bst -p
$ bst -p nodes.txt

Print a binary tree from a level order expression:

$ bst -l [4,#,7,5,9,#]   (leetcode format)
$ bst -l {4 # 7 5}

Print a random bst:

$ bst           (random bst of 10 nodes)
$ bst 5         (random bst of 5 nodes)
$ bst -b 7      (random balanced bst of 7 nodes)

To install drawtree, simply:

$ pip install drawtree

MIT

Draw tree

drawtree was written by Madhusudan Banik.