diff --git a/BytecodeApi.CommandLineParser/Option.cs b/BytecodeApi.CommandLineParser/Option.cs
index 0f8d1bb..d965147 100644
--- a/BytecodeApi.CommandLineParser/Option.cs
+++ b/BytecodeApi.CommandLineParser/Option.cs
@@ -45,7 +45,7 @@ public Option(string[] arguments, string[]? alternatives)
 			Check.ArgumentEx.ArrayElementsRequired(alternatives);
 			Check.ArgumentEx.ArrayValuesNotNull(alternatives);
 			Check.ArgumentEx.ArrayValuesNotStringEmpty(alternatives);
-			Check.Argument(alternatives.All(item => Validate.AlphaNumeric(item)), nameof(alternatives), "String must be alphanumeric.");
+			Check.Argument(alternatives.All(Validate.AlphaNumeric), nameof(alternatives), "String must be alphanumeric.");
 		}
 
 		Arguments = arguments.ToReadOnlyCollection();
diff --git a/BytecodeApi.CommandLineParser/OptionSet.cs b/BytecodeApi.CommandLineParser/OptionSet.cs
index 8724f8b..cb3f243 100644
--- a/BytecodeApi.CommandLineParser/OptionSet.cs
+++ b/BytecodeApi.CommandLineParser/OptionSet.cs
@@ -185,7 +185,8 @@ void ICollection<Option>.Add(Option item)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="OptionSet" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="OptionSet" />.
+	/// </returns>
 	public bool Remove(Option item)
 	{
 		return Options.Remove(item);
diff --git a/BytecodeApi.CsvParser/CsvDelimiterDetector.cs b/BytecodeApi.CsvParser/CsvDelimiterDetector.cs
index 17272c2..549a17e 100644
--- a/BytecodeApi.CsvParser/CsvDelimiterDetector.cs
+++ b/BytecodeApi.CsvParser/CsvDelimiterDetector.cs
@@ -38,7 +38,9 @@ public CsvDelimiterDetector(string[] delimitersToTest, int minRowsToTest, int ma
 	/// <para><see cref="MinRowsToTest" /> = 2</para>
 	/// <para><see cref="MaxRowsToTest" /> = 10</para>
 	/// </summary>
-	/// <returns>CsvDelimiterDetector.</returns>
+	/// <returns>
+	/// A new <see cref="CsvDelimiterDetector" /> with default values.
+	/// </returns>
 	public static CsvDelimiterDetector CreateDefault()
 	{
 		return new(new[] { ",", ";", "\t", "|" }, 2, 10);
diff --git a/BytecodeApi.CsvParser/CsvRowCollection.cs b/BytecodeApi.CsvParser/CsvRowCollection.cs
index 28c7e00..bd5083e 100644
--- a/BytecodeApi.CsvParser/CsvRowCollection.cs
+++ b/BytecodeApi.CsvParser/CsvRowCollection.cs
@@ -54,7 +54,8 @@ public void Add(CsvRow item)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="CsvRowCollection" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="CsvRowCollection" />.
+	/// </returns>
 	public bool Remove(CsvRow item)
 	{
 		return Rows.Remove(item);
diff --git a/BytecodeApi.IniParser/IniPropertyCollection.cs b/BytecodeApi.IniParser/IniPropertyCollection.cs
index b34a553..10e51ac 100644
--- a/BytecodeApi.IniParser/IniPropertyCollection.cs
+++ b/BytecodeApi.IniParser/IniPropertyCollection.cs
@@ -137,7 +137,8 @@ public IniProperty Add(string name, string value)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="IniPropertyCollection" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="IniPropertyCollection" />.
+	/// </returns>
 	public bool Remove(IniProperty item)
 	{
 		return Properties.Remove(item);
diff --git a/BytecodeApi.IniParser/IniSectionCollection.cs b/BytecodeApi.IniParser/IniSectionCollection.cs
index 670e0d9..0501095 100644
--- a/BytecodeApi.IniParser/IniSectionCollection.cs
+++ b/BytecodeApi.IniParser/IniSectionCollection.cs
@@ -135,7 +135,8 @@ public IniSection Add(string name)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="IniSectionCollection" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="IniSectionCollection" />.
+	/// </returns>
 	public bool Remove(IniSection item)
 	{
 		return Sections.Remove(item);
diff --git a/BytecodeApi.Lexer/TokenCollection.cs b/BytecodeApi.Lexer/TokenCollection.cs
index 3423b5b..cc2bc09 100644
--- a/BytecodeApi.Lexer/TokenCollection.cs
+++ b/BytecodeApi.Lexer/TokenCollection.cs
@@ -59,7 +59,8 @@ public void Add(Token<TTokenType> item)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="TokenCollection{TTokenType}" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="TokenCollection{TTokenType}" />.
+	/// </returns>
 	public bool Remove(Token<TTokenType> item)
 	{
 		return Tokens.Remove(item);
diff --git a/BytecodeApi/Data/BlobCollection.cs b/BytecodeApi/Data/BlobCollection.cs
index e874bbb..f59a7b9 100644
--- a/BytecodeApi/Data/BlobCollection.cs
+++ b/BytecodeApi/Data/BlobCollection.cs
@@ -143,7 +143,8 @@ public void Add(Blob item)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="BlobCollection" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="BlobCollection" />.
+	/// </returns>
 	public bool Remove(Blob item)
 	{
 		return Blobs.Remove(item);
diff --git a/BytecodeApi/Data/BlobTreeNodeCollection.cs b/BytecodeApi/Data/BlobTreeNodeCollection.cs
index 0e44d36..f2ff9dc 100644
--- a/BytecodeApi/Data/BlobTreeNodeCollection.cs
+++ b/BytecodeApi/Data/BlobTreeNodeCollection.cs
@@ -93,7 +93,8 @@ public void Add(BlobTreeNode item)
 	/// <returns>
 	/// <see langword="true" />, if <paramref name="item" /> is successfully removed;
 	/// otherwise, <see langword="false" />.
-	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="BlobTreeNodeCollection" />.</returns>
+	/// This method also returns <see langword="false" />, if <paramref name="item" /> was not found in the <see cref="BlobTreeNodeCollection" />.
+	/// </returns>
 	public bool Remove(BlobTreeNode item)
 	{
 		return Nodes.Remove(item);
diff --git a/BytecodeApi/Data/ICopy.cs b/BytecodeApi/Data/ICopy.cs
index 62cb284..1ca5a63 100644
--- a/BytecodeApi/Data/ICopy.cs
+++ b/BytecodeApi/Data/ICopy.cs
@@ -9,6 +9,8 @@ public interface ICopy<T>
 	/// <summary>
 	/// Creates a new instance and copies all properties.
 	/// </summary>
-	/// <returns>A new instance with all properties copied from this instance.</returns>
+	/// <returns>
+	/// A new instance with all properties copied from this instance.
+	/// </returns>
 	public T Copy();
 }
\ No newline at end of file
diff --git a/BytecodeApi/Data/IDeepCopy.cs b/BytecodeApi/Data/IDeepCopy.cs
index cdc5af3..b2d4590 100644
--- a/BytecodeApi/Data/IDeepCopy.cs
+++ b/BytecodeApi/Data/IDeepCopy.cs
@@ -9,6 +9,8 @@ public interface IDeepCopy<T>
 	/// <summary>
 	/// Creates a new instance and copies all properties, including navigation properties.
 	/// </summary>
-	/// <returns>A new instance with all properties, including navigation properties, copied from this instance.</returns>
+	/// <returns>
+	/// A new instance with all properties, including navigation properties, copied from this instance.
+	/// </returns>
 	public T DeepCopy();
 }
\ No newline at end of file
diff --git a/BytecodeApi/Data/TreeNode.cs b/BytecodeApi/Data/TreeNode.cs
new file mode 100644
index 0000000..e711305
--- /dev/null
+++ b/BytecodeApi/Data/TreeNode.cs
@@ -0,0 +1,382 @@
+using BytecodeApi.Extensions;
+using System.Collections;
+using System.Diagnostics;
+
+namespace BytecodeApi.Data;
+
+/// <summary>
+/// Represents an entry in a hierarchical tree structure.
+/// </summary>
+/// <typeparam name="T">The type of the value and its children.</typeparam>
+[DebuggerDisplay($"{nameof(TreeNode<T>)}: Value = {{Value}}, Children: {{Children.Count}}")]
+public class TreeNode<T> : IEnumerable<TreeNode<T>>, IEquatable<TreeNode<T>>
+{
+	private readonly List<TreeNode<T>> Children;
+	/// <summary>
+	/// Gets or sets the value that is associated with this node.
+	/// </summary>
+	public T Value { get; set; }
+	/// <summary>
+	/// Gets the child node at the specified index.
+	/// </summary>
+	/// <param name="index">The index at which to retrieve the child node.</param>
+	public TreeNode<T> this[int index]
+	{
+		get
+		{
+			Check.IndexOutOfRange(index, Count);
+			return Children[index];
+		}
+	}
+	/// <summary>
+	/// Gets the number of child nodes.
+	/// </summary>
+	public int Count => Children.Count;
+
+	/// <summary>
+	/// Gets the parent node, or <see langword="null" />, if this node is the root node.
+	/// </summary>
+	public TreeNode<T>? Parent { get; private set; }
+	/// <summary>
+	/// Gets the root node. If this node is already the root node, <see langword="this" /> is returned.
+	/// </summary>
+	public TreeNode<T>? Root => Parent == null ? this : Parent.Root;
+	/// <summary>
+	/// Gets the sibling that is to the left of this node. If this node is already the root node, or if this node is the first child, <see langword="null" /> is returned.
+	/// </summary>
+	public TreeNode<T>? Left
+	{
+		get
+		{
+			if (Parent == null)
+			{
+				return null;
+			}
+			else
+			{
+				int index = Parent.Children.IndexOf(this);
+				return index <= 0 ? null : Parent.Children[index - 1];
+			}
+		}
+	}
+	/// <summary>
+	/// Gets the sibling that is to the right of this node. If this node is already the root node, or if this node is the last child, <see langword="null" /> is returned.
+	/// </summary>
+	public TreeNode<T>? Right
+	{
+		get
+		{
+			if (Parent == null)
+			{
+				return null;
+			}
+			else
+			{
+				int index = Parent.Children.IndexOf(this);
+				return index < 0 || index >= Parent.Children.Count - 1 ? null : Parent.Children[index + 1];
+			}
+		}
+	}
+	/// <summary>
+	/// Gets the depth of this node, where 0 represents the root node, and 1 represents a node within the root, and so on.
+	/// </summary>
+	public int Level => Parent == null ? 0 : Parent.Level + 1;
+
+	/// <summary>
+	/// Initializes a new instance of the <see cref="TreeNode{T}" /> class.
+	/// </summary>
+	/// <param name="value">The value that is associated with this node.</param>
+	public TreeNode(T value)
+	{
+		Value = value;
+		Children = new();
+	}
+
+	/// <summary>
+	/// Creates a new child node with the specified value.
+	/// </summary>
+	/// <param name="value">The value that is associated with the new child node.</param>
+	/// <returns>
+	/// The newly created child node.
+	/// </returns>
+	public TreeNode<T> Add(T value)
+	{
+		TreeNode<T> node = new(value) { Parent = this };
+		Children.Add(node);
+		return node;
+	}
+	/// <summary>
+	/// Adds the specified child node. If <paramref name="node" /> is already part of a tree, it will be removed from its current parent node.
+	/// </summary>
+	/// <param name="node">The child node to be added.</param>
+	/// <returns>
+	/// A reference to <paramref name="node" />.
+	/// </returns>
+	public TreeNode<T> Add(TreeNode<T> node)
+	{
+		Check.ArgumentNull(node);
+
+		if (node.Parent != null)
+		{
+			node.Parent.Remove(node);
+		}
+
+		Children.Add(node);
+		return node;
+	}
+	/// <summary>
+	/// Removes the child node from this <see cref="TreeNode{T}" />.
+	/// </summary>
+	/// <param name="node">The <see cref="TreeNode{T}" /> to remove.</param>
+	/// <returns>
+	/// <see langword="true" />, if <paramref name="node" /> is successfully removed;
+	/// otherwise, <see langword="false" />.
+	/// </returns>
+	public bool Remove(TreeNode<T> node)
+	{
+		if (Children.Remove(node))
+		{
+			node.Parent = null;
+			return true;
+		}
+		else
+		{
+			return false;
+		}
+	}
+	/// <summary>
+	/// Removes all child nodes that satisfy a specified condition.
+	/// </summary>
+	/// <param name="predicate">A function to test each child node for a condition.</param>
+	/// <returns>
+	/// The number of removed child nodes.
+	/// </returns>
+	public int RemoveAll(Predicate<TreeNode<T>> predicate)
+	{
+		Check.ArgumentNull(predicate);
+
+		List<TreeNode<T>> removed = new();
+
+		foreach (TreeNode<T> node in Children)
+		{
+			if (predicate(node))
+			{
+				node.Parent = null;
+				removed.Add(node);
+			}
+		}
+
+		Children.RemoveRange(removed);
+		return removed.Count;
+	}
+	/// <summary>
+	/// Removes all child nodes where the value satisfies a specified condition.
+	/// </summary>
+	/// <param name="predicate">A function to test each child node's value for a condition.</param>
+	/// <returns>
+	/// The number of removed child nodes.
+	/// </returns>
+	public int RemoveAll(Predicate<T> predicate)
+	{
+		Check.ArgumentNull(predicate);
+
+		List<TreeNode<T>> removed = new();
+
+		foreach (TreeNode<T> node in Children)
+		{
+			if (predicate(node.Value))
+			{
+				node.Parent = null;
+				removed.Add(node);
+			}
+		}
+
+		Children.RemoveRange(removed);
+		return removed.Count;
+	}
+	/// <summary>
+	/// Removes a range of child nodes.
+	/// </summary>
+	/// <param name="nodes">A collection of nodes to remove.</param>
+	public void RemoveRange(IEnumerable<TreeNode<T>> nodes)
+	{
+		Check.ArgumentNull(nodes);
+
+		foreach (TreeNode<T> node in nodes.ToArray())
+		{
+			Remove(node);
+		}
+	}
+	/// <summary>
+	/// Removes all child nodes.
+	/// </summary>
+	public void Clear()
+	{
+		foreach (TreeNode<T> node in Children)
+		{
+			node.Parent = null;
+		}
+
+		Children.Clear();
+	}
+
+	/// <summary>
+	/// Retrieves all ancestor nodes, excluding this node.
+	/// </summary>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> that iterates all ancestor nodes, excluding this node.
+	/// </returns>
+	public IEnumerable<TreeNode<T>> Ancestors()
+	{
+		TreeNode<T>? current = Parent;
+
+		while (current != null)
+		{
+			yield return current;
+			current = current.Parent;
+		}
+	}
+	/// <summary>
+	/// Retrieves all ancestor nodes, including this node.
+	/// </summary>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> that iterates all ancestor nodes, including this node.
+	/// </returns>
+	public IEnumerable<TreeNode<T>> AncestorsAndSelf()
+	{
+		yield return this;
+
+		foreach (TreeNode<T> node in Ancestors())
+		{
+			yield return node;
+		}
+	}
+	/// <summary>
+	/// Retrieves all descendant nodes, excluding this node.
+	/// </summary>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> that iterates all descendant nodes, excluding this node.
+	/// </returns>
+	public IEnumerable<TreeNode<T>> Descendants()
+	{
+		foreach (TreeNode<T> child in Children)
+		{
+			yield return child;
+
+			foreach (TreeNode<T> node in child.Descendants())
+			{
+				yield return node;
+			}
+		}
+	}
+	/// <summary>
+	/// Retrieves all descendant nodes, including this node.
+	/// </summary>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> that iterates all descendant nodes, including this node.
+	/// </returns>
+	public IEnumerable<TreeNode<T>> DescendantsAndSelf()
+	{
+		yield return this;
+
+		foreach (TreeNode<T> node in Descendants())
+		{
+			yield return node;
+		}
+	}
+	/// <summary>
+	/// Retrieves all sibling nodes from the same parent, excluding this node. If this node represents the root of the tree, an empty sequence is returned.
+	/// </summary>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> that iterates all sibling nodes from the same parent, excluding this node.
+	/// </returns>
+	public IEnumerable<TreeNode<T>> Siblings()
+	{
+		foreach (TreeNode<T> sibling in SiblingsAndSelf())
+		{
+			if (sibling != this)
+			{
+				yield return sibling;
+			}
+		}
+	}
+	/// <summary>
+	/// Retrieves all sibling nodes from the same parent, including this node. If this node represents the root of the tree, an empty sequence is returned.
+	/// </summary>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> that iterates all sibling nodes from the same parent, including this node.
+	/// </returns>
+	public IEnumerable<TreeNode<T>> SiblingsAndSelf()
+	{
+		if (Parent != null)
+		{
+			foreach (TreeNode<T> sibling in Parent)
+			{
+				yield return sibling;
+			}
+		}
+	}
+
+	/// <summary>
+	/// Returns the name of this <see cref="TreeNode{T}" />.
+	/// </summary>
+	/// <returns>
+	/// The name of this <see cref="TreeNode{T}" />.
+	/// </returns>
+	public override string ToString()
+	{
+		return Value?.ToString() ?? "";
+	}
+	/// <summary>
+	/// Determines whether the specified <see cref="object" /> is equal to this instance.
+	/// </summary>
+	/// <param name="obj">The <see cref="object" /> to compare with this instance.</param>
+	/// <returns>
+	/// <see langword="true" />, if the specified <see cref="object" /> is equal to this instance;
+	/// otherwise, <see langword="false" />.
+	/// </returns>
+	public override bool Equals([NotNullWhen(true)] object? obj)
+	{
+		return obj is TreeNode<T> node && Equals(node);
+	}
+	/// <summary>
+	/// Determines whether <see cref="Value" /> of this instance is equal to that of another <see cref="TreeNode{T}" />.
+	/// </summary>
+	/// <param name="other">The <see cref="TreeNode{T}" /> to compare to this instance.</param>
+	/// <returns>
+	/// <see langword="true" />, if <see cref="Value" /> of this instance is equal to that of the <paramref name="other" /> parameter;
+	/// otherwise, <see langword="false" />.
+	/// </returns>
+	public bool Equals([NotNullWhen(true)] TreeNode<T>? other)
+	{
+		return
+			other != null &&
+			CSharp.TypeEquals(this, other) &&
+			Equals(Value, other.Value);
+	}
+	/// <summary>
+	/// Returns a hash code for this <see cref="TreeNode{T}" />.
+	/// </summary>
+	/// <returns>
+	/// The hash code for this <see cref="TreeNode{T}" /> instance.
+	/// </returns>
+	public override int GetHashCode()
+	{
+		return CSharp.GetHashCode(Value);
+	}
+
+	/// <summary>
+	/// Returns an enumerator that iterates through the <see cref="TreeNode{T}" />.
+	/// </summary>
+	/// <returns>
+	/// An enumerator that can be used to iterate through the <see cref="TreeNode{T}" />.
+	/// </returns>
+	public IEnumerator<TreeNode<T>> GetEnumerator()
+	{
+		return Children.GetEnumerator();
+	}
+	IEnumerator IEnumerable.GetEnumerator()
+	{
+		return Children.GetEnumerator();
+	}
+}
\ No newline at end of file
diff --git a/BytecodeApi/Data/TreeNodeBuilder.cs b/BytecodeApi/Data/TreeNodeBuilder.cs
new file mode 100644
index 0000000..2e1d402
--- /dev/null
+++ b/BytecodeApi/Data/TreeNodeBuilder.cs
@@ -0,0 +1,78 @@
+namespace BytecodeApi.Data;
+
+/// <summary>
+/// Helper class that creates and populates a <see cref="TreeNode{T}" /> structure.
+/// </summary>
+public static class TreeNodeBuilder
+{
+	/// <summary>
+	/// Creates a new <see cref="TreeNode{T}" /> structure.
+	/// </summary>
+	/// <typeparam name="T">The type of the value of the <see cref="TreeNode{T}" /> structure.</typeparam>
+	/// <param name="value">The value that is associated with the root node.</param>
+	/// <returns>
+	/// A <see cref="TreeNodeBuilder{T}" /> that can be used to populate the <see cref="TreeNode{T}" /> structure.
+	/// </returns>
+	public static TreeNodeBuilder<T> BeginTree<T>(T value)
+	{
+		return new(value);
+	}
+}
+
+/// <summary>
+/// Helper class that creates and populates a <see cref="TreeNode{T}" /> structure.
+/// </summary>
+/// <typeparam name="T">The type of the value of the <see cref="TreeNode{T}" /> structure.</typeparam>
+public sealed class TreeNodeBuilder<T>
+{
+	private readonly Stack<TreeNode<T>> Stack;
+	private bool EndTreeCalled;
+
+	internal TreeNodeBuilder(T value)
+	{
+		Stack = new();
+		Stack.Push(new TreeNode<T>(value));
+	}
+	/// <summary>
+	/// Creates a new child node with the specified value.
+	/// </summary>
+	/// <param name="value">The value that is associated with the new child node.</param>
+	/// <returns>
+	/// A reference to this instance after the operation has completed.
+	/// </returns>
+	public TreeNodeBuilder<T> Begin(T value)
+	{
+		Check.InvalidOperation(!EndTreeCalled, $"{nameof(TreeNodeBuilder<T>)}.{nameof(TreeNodeBuilder<T>.EndTree)} was already called.");
+
+		Stack.Push(Stack.Peek().Add(value));
+		return this;
+	}
+	/// <summary>
+	/// Closes the current node and goes back to the parent node. A call to <see cref="Begin(T)" /> will proceed to create nodes in the parent node.
+	/// </summary>
+	/// <returns>
+	/// A reference to this instance after the operation has completed.
+	/// </returns>
+	public TreeNodeBuilder<T> End()
+	{
+		Check.InvalidOperation(!EndTreeCalled, $"{nameof(TreeNodeBuilder<T>)}.{nameof(TreeNodeBuilder<T>.EndTree)} was already called.");
+		Check.InvalidOperation(Stack.Count > 1, $"There is no {nameof(TreeNode<T>)} on the stack to close. Did you call {nameof(TreeNodeBuilder<T>)}.{nameof(TreeNodeBuilder<T>.End)} too many times?");
+
+		Stack.Pop();
+		return this;
+	}
+	/// <summary>
+	/// Closes the final node and returns the <see cref="TreeNode{T}" />.
+	/// </summary>
+	/// <returns>
+	/// The <see cref="TreeNode{T}" /> that this instance created.
+	/// </returns>
+	public TreeNode<T> EndTree()
+	{
+		Check.InvalidOperation(!EndTreeCalled, $"{nameof(TreeNodeBuilder<T>)}.{nameof(TreeNodeBuilder<T>.EndTree)} can be be called only once.");
+		Check.InvalidOperation(Stack.Count == 1, Stack.Count == 0 ? $"There is no {nameof(TreeNode<T>)} on the stack to return. Did you call {nameof(TreeNodeBuilder<T>)}.{nameof(TreeNodeBuilder<T>.End)} too many times?" : $"The tree is not completed. Call {nameof(TreeNodeBuilder<T>)}.{nameof(TreeNodeBuilder<T>.End)} to close the last {nameof(TreeNode<T>)}.");
+
+		EndTreeCalled = true;
+		return Stack.Pop();
+	}
+}
\ No newline at end of file
diff --git a/BytecodeApi/Data/TreeNodeExtensions.cs b/BytecodeApi/Data/TreeNodeExtensions.cs
new file mode 100644
index 0000000..473a2d6
--- /dev/null
+++ b/BytecodeApi/Data/TreeNodeExtensions.cs
@@ -0,0 +1,23 @@
+namespace BytecodeApi.Data;
+
+/// <summary>
+/// Provides a set of <see langword="static" /> methods for interaction with <see cref="TreeNode{T}" /> objects.
+/// </summary>
+public static class TreeNodeExtensions
+{
+	/// <summary>
+	/// Retrieves the value from each element in <paramref name="nodes" />.
+	/// </summary>
+	/// <typeparam name="T">The type of the <see cref="TreeNode{T}" />.</typeparam>
+	/// <param name="nodes">A sequence of <see cref="TreeNode{T}" /> to query.</param>
+	/// <returns>
+	/// An <see cref="IEnumerable{T}" /> whose elements represent the value of the input sequence.
+	/// </returns>
+	public static IEnumerable<T> Values<T>(this IEnumerable<TreeNode<T>> nodes)
+	{
+		foreach (TreeNode<T> node in nodes)
+		{
+			yield return node.Value;
+		}
+	}
+}
\ No newline at end of file
diff --git a/BytecodeApi/Extensions/EnumerableExtensions.cs b/BytecodeApi/Extensions/EnumerableExtensions.cs
index 0208c35..5fdd7d5 100644
--- a/BytecodeApi/Extensions/EnumerableExtensions.cs
+++ b/BytecodeApi/Extensions/EnumerableExtensions.cs
@@ -675,15 +675,22 @@ public static void AddRange<TSource>(this ICollection<TSource> source, IEnumerab
 	/// <typeparam name="TSource">The type of the elements to remove.</typeparam>
 	/// <param name="source">The <see cref="ICollection{T}" /> to remove elements from.</param>
 	/// <param name="predicate">A function to test each element for a condition.</param>
-	public static void RemoveAll<TSource>(this ICollection<TSource> source, Func<TSource, bool> predicate)
+	/// <returns>
+	/// The number of removed elements.
+	/// </returns>
+	public static int RemoveAll<TSource>(this ICollection<TSource> source, Func<TSource, bool> predicate)
 	{
 		Check.ArgumentNull(source);
 		Check.ArgumentNull(predicate);
 
-		foreach (TSource item in source.Where(itm => predicate(itm)).ToArray())
+		TSource[] removed = source.Where(predicate).ToArray();
+
+		foreach (TSource item in removed)
 		{
 			source.Remove(item);
 		}
+
+		return removed.Length;
 	}
 	/// <summary>
 	/// Removes all elements that occur in the specified collection.