We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent dcd8950 commit 15a8031Copy full SHA for 15a8031
14_树与二叉树/tree/index.html
@@ -341,7 +341,7 @@ <h1 id="_5">二叉树的表示</h1>
341
root = node
342
node.left = node_dict.get(node_data['left'])
343
node.right = node_dict.get(node_data['right'])
344
- return cls(root)
+ return cls(root)
345
btree = BinTree.build_from(node_list)
346
</code></pre>
347
index.html
@@ -488,5 +488,5 @@ <h2 id="_19">本电子书制作和写作方式</h2>
488
489
<!--
490
MkDocs version : 0.17.3
491
-Build Date UTC : 2018-06-10 08:18:38
+Build Date UTC : 2018-06-10 08:19:16
492
-->
0 commit comments