more re-org

ianhi · ianhi · commit 161f35ea0891 · 2026-02-05T16:58:52.000-05:00
diff --git a/_toc.yml b/_toc.yml
@@ -66,7 +66,9 @@ parts:
 
   - caption: Advanced
     chapters:
-      - file: advanced/why-trees.md
+      - file: advanced/indexing/indexing.md
+        sections:
+          - file: advanced/indexing/why-trees.md
       - file: advanced/parallel-intro.md
       - file: advanced/apply_ufunc/apply_ufunc.md
         sections:
diff --git a/advanced/indexing/indexing.md b/advanced/indexing/indexing.md
@@ -0,0 +1,4 @@
+# Indexing
+
+```{tableofcontents}
+```
diff --git a/advanced/indexing/why-trees.md b/advanced/indexing/why-trees.md
@@ -14,6 +14,10 @@ kernelspec:
 
 # Tree-Based Indexing
 
+```{seealso}
+[NDPointIndex](https://xarray-indexes.readthedocs.io/blocks/ndpoint.html) — use KD-trees and Ball trees with xarray's indexing system for efficient nearest-neighbor lookups on real datasets.
+```
+
 Imagine you have measurements at irregular locations and want to find the **nearest** data point to your query location.
 
 **In this notebook you'll learn:**

-Original file line number
+Diff line change
@@ @@ -0,0 +1,4 @@ @@
 +# Indexing
++
 +```{tableofcontents}
 +```