     selectors = get_selectors(selector_as_string)
 
     html_tree
-    |> transverse([], selectors, [])
+    |> traverse([], selectors, [])
     |> Enum.reverse
   end
 

          nil -> [sibling_node|res_acc]
          _ ->
            {_, _, children_nodes} = sibling_node
            transverse(children_nodes, sibling_nodes, selector.combinator.selector, res_acc)
        end
      else
        res_acc

        acc
      end

    traverse(children_nodes, sibling_nodes, selector, acc)
  end

  defp traverse_child(nodes, sibling_nodes, selector, acc) do
    Enum.reduce(nodes, acc, fn(n, res_acc) ->
      if Selector.match?(n, selector) do
        case selector.combinator do
          nil -> [n|res_acc]
          _ ->
            {_, _, children_nodes} = n
            traverse(children_nodes, sibling_nodes, selector.combinator.selector, res_acc)
        end
      else
        res_acc
