This question can be easily solved in O(n + m) per query, however is this possible to answer such queries in better complexity with preprocessing better than O(n²) ? In tree it can be easily done...

I have the following json file named CMakePresets.json that is a cmake-preset file: { "configurePresets": [ { "name": "default", "hidden": true, "g...

I have an arbitrary tree structure. Example data structure: root |--node1 | |--node2 | | |--leaf1 | | | |--leaf2 | |--node3 |--leaf3 Each node and leaf has 2 properties: id and name. ...

I met a problem while using PMD to check my code errors. I do not know how to satisfy two requirements at the same time. For example, if I want to check a method named ABC not existing in file exte...

Check if 2 tree nodes are related (i.e. ancestor-descendant) solve it in O(1) time, with O(N) space (N = # of nodes) pre-processing is allowed That's it. I'll be going to my solution (approach)...

One can use matchedset.find(selector) / matchedset.parents(selector) to get the descendants/ancestors of the current matched set filtered by a selector, but that doesn't include the matched set its...

jQuery has a lovely if somewhat misnamed method called closest() that walks up the DOM tree looking for a matching element. For example, if I've got this HTML: <table src="foo"> <tr> ...

Is is possible to use jQuery to select an ancestor of an element? Markup: <div id="ancestor-1"> <div> <a href="#" class="click-me">Click me</a> </div> </div&gt...

With my current node selected I wish to find an element <name> [./name] and return the text content. If an element <name> does not exist in the currently selected node I wish to check t...

Are the children of an entity available in a Query? Given: class Factory(db.Model): """ Parent-kind """ name = db.StringProperty() class Product(db.Model): """ Child kind, use Product(parent=...