Databases
StackOverflow2013
Postsdbo
POAVL Trees: How to do index access?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POAVL Trees: How to do index access?
    primarykey
    data
    text
    <p>I noticed on the <a href="http://en.wikipedia.org/wiki/AVL_tree" rel="nofollow">AVL Tree Wikipedia page</a> the following comment:</p> <p>"If each node additionally records the size of its subtree (including itself and its descendants), then the nodes can be retrieved by index in O(log n) time as well."</p> <p>I've google and have found a few places mentioning <a href="http://www.gap-system.org/Manuals/pkg/orb/doc/chap8.html" rel="nofollow">accessing by index</a> but can't seem to find an explanation of the algorithm one would write. </p> <p>Many thanks</p> <p>[UPDATE] Thanks people. If found @templatetypedef answer combined with one of @user448810 <a href="http://programmingpraxis.com/2011/11/29/avl-trees-extended/2/" rel="nofollow">links</a> to particularly help. Especially this snipit:</p> <p>"The key to both these functions is that the index of a node is the size of its left child. As long as we are descending a tree via its left child, we just take the index of the node. But when we have to move down the tree via its right child, we have to adjust the size to include the half of the tree that we have excluded."</p> <p>Because my implementation is immutable I didn't need to do any additional work when rebalancing as each node calculates it's size on construction (same as the scheme impl linked)</p> <p>My final implementation ended up being:</p> <pre class="lang-java prettyprint-override"><code>class Node&lt;K,V&gt; implements AVLTree&lt;K,V&gt; { ... public V index(int i) { if (left.size() == i) return value; if (i &lt; left.size()) return left.index(i); return right.index(i - left.size() - 1); } } class Empty&lt;K,V&gt; implements AVLTree&lt;K,V&gt; { ... public V index(int i) { throw new IndexOutOfBoundsException();} } </code></pre> <p>Which is slightly different from the other implementations, let me know if you think I have a bug!</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USDaniel Worthington-Bodart
    1. USDaniel Worthington-Bodart
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POAVL Trees: How to do index access?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POAVL Trees: How to do index access?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POAVL Trees: How to do index access?
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload