Merge pull request #20 from johannalee/patch-1

Update README.md

Author: Lodin

README.md

@@ -72,7 +72,7 @@ function* treeWalker(refresh) {
   // Walk through the tree until we have no nodes available.
   while (stack.length !== 0) {
     const {
-      node: {children, id, name},
+      node: {children = [], id, name},
       nestingLevel,
     } = stack.pop();
 
@@ -93,13 +93,13 @@ function* treeWalker(refresh) {
 
     // Basing on the node openness state we are deciding if we need to render
     // the child nodes (if they exist).
-    if (node.children.length !== 0 && isOpened) {
+    if (children.length !== 0 && isOpened) {
       // Since it is a stack structure, we need to put nodes we want to render
       // first to the end of the stack.
-      for (let i = node.children.length - 1; i >= 0; i--) {
+      for (let i = children.length - 1; i >= 0; i--) {
         stack.push({
           nestingLevel: nestingLevel + 1,
-          node: node.children[i],
+          node: children[i],
         });
       }
     }
@@ -242,7 +242,7 @@ function* treeWalker(refresh) {
 
   while (stack.length !== 0) {
     const {
-      node: {children, id, name},
+      node: {children = [], id, name},
       nestingLevel,
     } = stack.pop();
 
@@ -260,11 +260,11 @@ function* treeWalker(refresh) {
         }
       : id;
 
-    if (node.children.length !== 0 && isOpened) {
-      for (let i = node.children.length - 1; i >= 0; i--) {
+    if (children.length !== 0 && isOpened) {
+      for (let i = children.length - 1; i >= 0; i--) {
         stack.push({
           nestingLevel: nestingLevel + 1,
-          node: node.children[i],
+          node: children[i],
         });
       }
     }