Fix minor typos

Author: serenity4

src/indexing.jl

@@ -7,7 +7,7 @@ Obtain a node from a tree by indexing each level of the tree with the elements o
 This function is defined for all trees regardless of whether they have the [`IndexedChildren`](@ref).
 This is because a tree without [`IndexedChildren`](@ref) might have special cases in which all children
 are indexable, a prominent example being `Array` which may not have indexable sub-trees (e.g. an
-array contianing a Dict) but there are common special cases in which array trees are fully indexable
+array containing a Dict) but there are common special cases in which array trees are fully indexable
 (e.g. a tree in which every non-leaf node is an array).
 
 The elements of `idx` can be any argument to `getindex`, not necessarily integers.  For example,

src/traits.jl

@@ -117,7 +117,7 @@ struct IndexedChildren <: ChildIndexing end
     NonIndexedChildren <: ChildIndexing
 
 Indicates that the object returned by `children(n)` where `n` is a tree node is not necessarily indexable.
-This trait applies to any tree which cannot guarantee indexable children in all cases, ragardless of whether
+This trait applies to any tree which cannot guarantee indexable children in all cases, regardless of whether
 the tree is indexable in special cases.  For example, `Array` has this trait even though there is a large
 class of indexable trees consisting of arrays.
 """