diff --git a/conllu/parser.py b/conllu/parser.py
index <HASH>..<HASH> 100644
--- a/conllu/parser.py
+++ b/conllu/parser.py
@@ -22,7 +22,7 @@ def parse_tree(text):
         for token in sentence:
             head_indexed[token["head"]].append(token)
 
-        trees.append(create_tree(head_indexed))
+        trees += create_tree(head_indexed)
 
     return trees
 
diff --git a/tests/fixtures/data1_tree.py b/tests/fixtures/data1_tree.py
index <HASH>..<HASH> 100644
--- a/tests/fixtures/data1_tree.py
+++ b/tests/fixtures/data1_tree.py
@@ -1,7 +1,7 @@
 from collections import OrderedDict
 from conllu.tree_helpers import TreeNode
 
-data1_expected = [[
+data1_expected = [
     TreeNode(
         data=OrderedDict([
             ('id', 5),
@@ -160,4 +160,4 @@ data1_expected = [[
             )
         ]
     )
-]]
+]
There's always just one root, no need for a list.