1. You cannot configure a leaf node as the master node because it does not have direct access to all the nodes other than its non-root server.

2. Furthermore, if a leaf node gets split or merged during data insertion or deletion or update, it may take longer for the whole index to adjust the change.

3. Looking at just the leaf node, this resembles the source code to a fair extend. Next this is translated into the machine code of the regular expression engine.

4. This is a leaf node and cannot contain other nodes. It is a child of the "Item" TiXmlElement.

5. Eventually, the algorithm reaches a leaf node with the final classification.

6. For example, a leaf node knows itself and its parent.

7. For information on how to remove a leaf node or entire node subtree from a document( ), see Removing Nodes from the DOM.

8. Schema: Schemas that have a leaf node whose depth exceeds 500 are not supported.

9. Select the test case MoneyBag Equals (the red leaf node) and locate the problem line in each file. This information is given in the lower part of NUnit's right hand pane, shown in Figure 3 .

10. Based on faceted classification schema and theory of tree mapping, a novel matching model named leaf node containment matching model and correspondence retrieving algorithm are put forward.

11. In the network model, Nodes change between the three roles: root node, branch node and leaf node, to organize and maintain the network tree structure.

12. In an HDBMS like the one illustrated above, the only way to discover this would be an extremely costly search of every book leaf node.

13. Note: If you are connected to a non-root node or a leaf node, the information that you can view and the actions that you can take are limited.

14. An element can consist of a sequence of elements, in which case the corresponding tree node has child nodes, or character data, in which case the node is a leaf node.

15. This framework is of layered and distributed structure, including a central control node layer, a convergent node layer and a leaf node layer.

16. The XPath for a computed value should be a leaf node only.

17. The algorithm explores the space and adds a new node to a random tree of which root node is position of robot until the leaf node of the tree contains the goal node.

18. For example, if a certain element is always a leaf node in a particular document type (and has no XML attributes), you might want to refer to its PCDATA just by the node name itself.

19. For large files (including those that are fragmented), an inode can reference an index node, each of which can reference a leaf node (referencing multiple extents).