move to advanced

Author: ianhi

_toc.yml

@@ -46,7 +46,6 @@ parts:
         sections:
           - file: intermediate/indexing/advanced-indexing.ipynb
           - file: intermediate/indexing/boolean-masking-indexing.ipynb
-          - file: intermediate/indexing/why-trees.md
       - file: intermediate/xarray_and_dask
       - file: intermediate/intro-to-zarr.ipynb
       - file: intermediate/storage_formats.ipynb
@@ -67,6 +66,7 @@ parts:
 
   - caption: Advanced
     chapters:
+      - file: advanced/why-trees.md
       - file: advanced/parallel-intro.md
       - file: advanced/apply_ufunc/apply_ufunc.md
         sections:

intermediate/indexing/why-trees.md advanced/why-trees.mdintermediate/indexing/why-trees.md renamed to advanced/why-trees.md

@@ -12,7 +12,7 @@ kernelspec:
   name: python3
 ---
 
-# Why KD-Trees?
+# Tree-Based Indexing
 
 Imagine you have measurements at irregular locations and want to find the **nearest** data point to your query location.