Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with ds.data-structures
Search options not deleted
user 20581
Properties and applications of data structures, such as space lower bounds, or time complexity of insertion and deletion of objects.
2
votes
O(n)-space, polylog-time subtree sums in incremental forests?
Thanks to Dmytro Taranovsky for the thorough answer. Here's my attempt to rephrase his answer in my own words.
Without loss of generality, assume that $G$ consists of a single tree.
First, we reduce t …
- 393
9
votes
2
answers
383
views
O(n)-space, polylog-time subtree sums in incremental forests?
Consider a forest $G$ of $n$ vertices $v_1, \dots, v_n$ arranged left to right with edges from child to parent always going to the left, i.e. if the parent of vertex $v_i$ is $v_j$, then $j < i$.
Addi …
- 393