Philiprehberger.TreeStructure 0.2.1

Philiprehberger.TreeStructure

Generic tree data structure with traversal, serialization, subtree mutation, lowest common ancestor, and flat-to-tree conversion.

Installation

dotnet add package Philiprehberger.TreeStructure

Usage

using Philiprehberger.TreeStructure;

var root = TreeNode<string>.Create("root");
var child1 = root.AddChild("child-1");
var child2 = root.AddChild("child-2");
var grandchild = child1.AddChild("grandchild-1");

Console.WriteLine(root.IsRoot);       // True
Console.WriteLine(grandchild.IsLeaf); // True
Console.WriteLine(grandchild.Depth);  // 2

Traverse

using Philiprehberger.TreeStructure;

// Depth-first (default)
foreach (var node in root.Traverse())
{
    Console.WriteLine(node.Value);
}

// Breadth-first
foreach (var node in root.Traverse(TraversalMode.BreadthFirst))
{
    Console.WriteLine(node.Value);
}

// Depth-limited traversal (root + children only)
foreach (var node in root.Traverse(TraversalMode.DepthFirst, maxDepth: 1))
{
    Console.WriteLine(node.Value);
}

// Find and path
var found = root.Find(v => v == "grandchild-1");
var path = found?.PathToRoot(); // [grandchild-1, child-1, root]

Flat-to-Tree Conversion

using Philiprehberger.TreeStructure;

var items = new[]
{
    new { Id = 1, ParentId = (int?)null, Name = "Root" },
    new { Id = 2, ParentId = (int?)1,    Name = "Child A" },
    new { Id = 3, ParentId = (int?)1,    Name = "Child B" },
    new { Id = 4, ParentId = (int?)2,    Name = "Grandchild" },
};

var tree = TreeBuilder.FromFlat(items, x => x.Id, x => x.ParentId);
Console.WriteLine(tree.ToTreeString());

Serialization

using Philiprehberger.TreeStructure;

var root = TreeNode<string>.Create("root");
root.AddChild("child-1");
root.AddChild("child-2");

// Serialize to JSON
string json = root.Serialize();
// {"value":"root","children":[{"value":"child-1","children":[]},{"value":"child-2","children":[]}]}

// Deserialize back to a tree
var restored = TreeNode<string>.Deserialize(json);

Subtree Mutation

using Philiprehberger.TreeStructure;

var root = TreeNode<string>.Create("root");
var child1 = root.AddChild("child-1");
var child2 = root.AddChild("child-2");
var grandchild = child1.AddChild("grandchild");

// Move a node to a new parent
grandchild.MoveTo(child2);

// Remove a node from the tree
child1.Remove();

// Positional insertion
var newNode = TreeNode<string>.Create("new");
newNode.InsertBefore(child2);
newNode.InsertAfter(child2);

Lowest Common Ancestor

using Philiprehberger.TreeStructure;

var root = TreeNode<string>.Create("root");
var child1 = root.AddChild("child-1");
var child2 = root.AddChild("child-2");
var gc1 = child1.AddChild("gc-1");
var gc2 = child2.AddChild("gc-2");

var lca = TreeNode<string>.FindLCA(gc1, gc2); // root
var lca2 = TreeNode<string>.FindLCA(child1, gc1); // child-1

API

Development

dotnet build src/Philiprehberger.TreeStructure.csproj --configuration Release

Support

If you find this project useful:

⭐ Star the repo

🐛 Report issues

💡 Suggest features

❤️ Sponsor development

🌐 All Open Source Projects

💻 GitHub Profile

🔗 LinkedIn Profile

License

MIT