Use deepcopy when serializing subtrees
在序列化子树时使用deepcopy
Xml.pulldom builds accessed subtrees only as needed.
pulldom只在需要时构建被访问的子树。
Pulldom is built on top of minidom, but can selectively build subtrees.
pulldom构建在minidom之上，但是可以有选择地构建子树。
You can think of levels in a FOT index as smaller subtrees (buckets).
您可以将FOT索引中的级视作较小的子树(桶)。
The search bases specified must be subtrees of the base entry in the repository.
指定的搜索基必须是存储库中基本项的子树。
Compounds are encapsulated subtrees built from base nodes and other compounds.
复合节点是利用基本节点或者其他的复合节点构建的封装子树。
We might then more simply create n-ary subtrees of "as many plains as possible."
然后，我们就可以更简单地创建“plain尽可能多”的n - ary子树了。
Single files and directory subtrees may be restored from full or partial backups.
可以从完全或部分备份中还原单独的文件或者目录树。
Root in the value of not less than all-roots values, which are all subtrees heap.
根结点的值不小于所有子树根的值，且所有子树均为堆。
Active Directory supports user information being distributed across different subtrees.
ActiveDirectory支持分布于不同子树的用户信息。
Single files and directory subtrees may also be restored from full or partial backups.
单独的文件和目录子树也可以从全部或部分备份中恢复。
The operation rules and the transformation steps between model subtrees are described.
论述操作规则和模型结构子树的构建步骤。
For this scenario, click the Subtrees button to recursively compare the two complete configurations.
对于此场景，请单击subtrees按钮，从而以递归方式比较两个完整配置。
Another idea I had some time later was to allow subtrees to be loaded and populated at runtime.
另一个之后不久我提出的想法是允许运行的时候加载和填充子树。
The command in Listing 1 creates a FOT index on tab_1 table on col1 with 1000 buckets (subtrees).
清单1中的命令创建了 col1上 tab_1 表格中的FOT索引，有 1000 个桶（子树）。
If you want additional subtrees configured, add additional base entries with appropriate subtree roots.
如果您希望配置其他子树，可以在适当的子树根中添加其他基本项。
If you want additional subtrees configured, add additional base entries with the appropriate subtree roots.
如果您想要配置其他子树，可以添加含有适当子树根的其他库条目。
This required that all subtrees are all under the same suffix, since there is no common parent between suffixes.
这需要所有的子树都位于相同的后缀中，因为后缀之间不存在公共父节点。
Also, the metadata conditions can be easily explored by opening and closing the subtrees without selecting them.
此外，通过打开和关闭子树(没有选中它们)，可以很容易地研究元数据条件。
To which is still unable to complete the parsing, chooses certain widest subtrees compulsion matched and then outputs.
对依然无法完成的分析，选择若干最宽子树强制匹配输出。
In some cases, we may actually want to traverse these nodes in the reverse order, skip certain nodes or subtrees, or something else.
在某些情况下，我们实际可能希望按照相反的顺序遍历这些节点、跳过某些节点或子树或其他一些内容。
we can aggregate subtrees of the "plain" type pairwise. But I would prefer if Spark allowed a more EBNF-style grammar expression like this
我们可以成对地聚集“plain“类型的子树。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
However, IE6 does have the advantage of displaying XML documents that lack a CSS2 style sheet in a hierarchical tree, and it allows folding subtrees.
不过，IE6在显示分层树中缺少CSS2样式表的XML文档方面确有优势，而且它允许折叠子树。
Likewise, markup subtrees (i.e. "emph", "strong", "module", "code", "title") are collapsed to a single node of the right type, and containing a compound string.
同样，标记子树(即“emph”、“strong”、“module”、“code”和“title”)折叠为一个类型正确的单独节点，并包含一个复合字符串。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
对于这个问题，一个高度平衡的二叉树是指每个节点的两个子节点的深度的差异都不超过1的二叉树。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
二叉树平衡的条件是左子树平衡且右子树平衡且左右子树的高度相差最多为1。基于这个思路递归处理。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
题目大意：给定一棵二叉树，请判断该二叉树是否是平衡二叉树。 所谓平衡二叉树就是每个节点的两颗子树深度不超过1。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
题目大意：给定一棵二叉树，请判断该二叉树是否是平衡二叉树。 所谓平衡二叉树就是每个节点的两颗子树深度不超过1。
应用推荐