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

    end)
  end

  defp transverse_sibling(_nodes, sibling_nodes, selector, acc) do
    sibling_node = Enum.drop_while(sibling_nodes, &ignore_node?/1) |> hd

    if Selector.match?(sibling_node, selector) do

    selectors = get_selectors(selector_as_string)

    html_tree
    |> traverse([], selectors, [])
    |> Enum.reverse
  end

