[selectors] Remove lingering references to 'element tree'.

Author: tabatkins

selectors/Overview.bs

@@ -21,7 +21,7 @@ Abstract: Selectors Level 4 describes the selectors that already exist in [[!SEL
 At Risk: the column combinator
 At Risk: the '':drop()'' pseudo-class
 At Risk: the '':read-write'' pseudo-class
-Ignored Terms: DocumentFragment, math, h1, shadow tree, box tree, query(), element tree, quirks mode
+Ignored Terms: DocumentFragment, math, h1, shadow tree, box tree, query(), quirks mode
 Link Defaults: html5 (element) a, dom-core-ls (interface) document
 </pre>
 <style>
@@ -507,7 +507,7 @@ Structure and Terminology</h3>
 
 	A <dfn id="compound" export>compound selector</dfn>
 	is a sequence of <a>simple selectors</a>
-	that are not separated by a <a>combinator</a>.
+	that are not separated by a <a>combinator</a>.and one or mo
 	If it contains a <a>type selector</a> or <a>universal selector</a>,
 	that selector comes first in the sequence.
 	Only one type selector or universal selector is allowed in the sequence.
@@ -545,7 +545,7 @@ Evaluating a Selector</h3>
 	This section describes how to <dfn export>evaluate a selector</dfn> against a set of elements.
 
 	APIs using this algorithm must provide a selector,
-	and one or more <a>element tree</a> root elements
+	and one or more root elements
 	indicating the trees that will be searched by the selector.
 	They may optionally provide:
 
@@ -575,7 +575,7 @@ Evaluating a Selector</h3>
 
 	A <a>selector</a> is evaluated against some initial list of elements:
 	the <dfn export>selector match list</dfn>.
-	The <a>selector match list</a> is initially populated with the <a>element tree</a> roots
+	The <a>selector match list</a> is initially populated with the root elements
 	provided to the algorithm,
 	and all elements reachable from them by traversing any number of child lists.