From 75736ac52e6664afec29ed65033b4d508c2509f8 Mon Sep 17 00:00:00 2001
From: anthonyrocom <57441926+anthonyrocom@users.noreply.github.com>
Date: Wed, 6 Nov 2019 12:43:21 +0100
Subject: [PATCH] to_dict() did not pass key on recursion for sort

Added the @key parameter to the self.to_dict so that child nodes are also sorted by the key
---
 treelib/tree.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/treelib/tree.py b/treelib/tree.py
index 62d3549..6844367 100644
--- a/treelib/tree.py
+++ b/treelib/tree.py
@@ -852,7 +852,7 @@ def to_dict(self, nid=None, key=None, sort=True, reverse=False, with_data=False)
 
             for elem in queue:
                 tree_dict[ntag]["children"].append(
-                    self.to_dict(elem.identifier, with_data=with_data, sort=sort, reverse=reverse))
+                    self.to_dict(elem.identifier, key=key, with_data=with_data, sort=sort, reverse=reverse))
             if len(tree_dict[ntag]["children"]) == 0:
                 tree_dict = self[nid].tag if not with_data else \
                     {ntag: {"data": self[nid].data}}