1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
from asciitree import draw_tree
def test_behaves_as_originally_advertised():
expected_output = """root
+--sub1
+--sub2
| +--sub2sub1
+--sub3
+--sub3sub1
| +--sub3sub1sub1
+--sub3sub2"""
class Node(object):
def __init__(self, name, children):
self.name = name
self.children = children
def __str__(self):
return self.name
root = Node('root', [
Node('sub1', []),
Node('sub2', [
Node('sub2sub1', [])
]),
Node('sub3', [
Node('sub3sub1', [
Node('sub3sub1sub1', [])
]),
Node('sub3sub2', [])
])
])
assert draw_tree(root) == expected_output
|
