blocks|key|589478|text|如果您只需要树数据结构，只需定义您自己的即可。(将失去更少时间)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|589479|public+abstract+class+NodeAbstract
{
+++abstract+NodeAbstract+Left+{get;set:}
+++abstract+NodeAbstract+Right+{get;set:}
+++....+
+++....
}

public+class+NodeConcrete+:+NodeAbstract
{

+++....+
+++//implementation
}|code-block|syntax|javascript|589480|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

If you need only tree datastructure, just define yours. (will loose less time)

<pre><code>public abstract class NodeAbstract
{
 abstract NodeAbstract Left {get;set:}
 abstract NodeAbstract Right {get;set:}
 .... 
 ....
}

public class NodeConcrete : NodeAbstract
{

 .... 
 //implementation
}
</code></pre>

blocks|key|715061|text|如果你只需要最基本的功能，那就构建你自己的数据结构。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|715062|我快速实现了一个基本的树(有向边，不一定是二叉树)，假设你有一个固定的根节点。我还添加了深度优先和广度优先的搜索方法。|715063|using+System;
using+System.Collections.Generic;
namespace+TreeTest
{
++++class+Program
++++{
++++++++static+void+Main(string[]+args)
++++++++{
++++++++++++//Build+example+tree
++++++++++++Tree+tree+=+new+Tree();
++++++++++++Node+a+=+new+Node(2);
++++++++++++Node+b+=+new+Node(7);
++++++++++++Node+c+=+new+Node(2);
++++++++++++Node+d+=+new+Node(6);
++++++++++++Node+e+=+new+Node(5);
++++++++++++Node+f+=+new+Node(11);
++++++++++++Node+g+=+new+Node(5);
++++++++++++Node+h+=+new+Node(9);
++++++++++++Node+i+=+new+Node(4);

++++++++++++tree.rootNode+=+a;
++++++++++++a.Edges.Add(b);
++++++++++++b.Edges.Add(c);
++++++++++++b.Edges.Add(d);
++++++++++++d.Edges.Add(e);
++++++++++++d.Edges.Add(f);
++++++++++++a.Edges.Add(g);
++++++++++++g.Edges.Add(h);
++++++++++++h.Edges.Add(i);

++++++++++++//Find+node+scannin+tree+from+top+down
++++++++++++Node+node+=+tree.FindByValueBreadthFirst(6);
++++++++++++Console.WriteLine(node+!=+null+?+"Found+node"+:+"Did+not+find+node");

++++++++++++//Find+node+scanning+tree+branch+for+branch.
++++++++++++node+=+tree.FindByValueDepthFirst(2);
++++++++++++Console.WriteLine(node+!=+null+?+"Found+node"+:+"Did+not+find+node");

++++++++++++Console.WriteLine("PRESS+ANY+KEY+TO+EXIT");
++++++++++++Console.ReadKey();
++++++++}
++++}
++++class+Tree
++++{
++++++++public+Node+rootNode;
++++++++public+Node+FindByValueDepthFirst(int+val)
++++++++{
++++++++++++return+rootNode.FindRecursiveDepthFirst(val);
++++++++}
++++++++public+Node+FindByValueBreadthFirst(int+val)
++++++++{
++++++++++++if+(rootNode.Value+==+val)
++++++++++++++++return+rootNode;
++++++++++++else
++++++++++++++++return+rootNode.FindRecursiveBreadthFirst(val);
++++++++}
++++}
++++class+Node
++++{
++++++++public+int+Value+{+get;+set;+}
++++++++public+IList<Node>+Edges+{+get;+set;+}
++++++++public+Node(int+val)
++++++++{
++++++++++++Value+=+val;
++++++++++++Edges+=+new+List<Node>(2);
++++++++}
++++++++public+Node+FindRecursiveBreadthFirst(int+val)
++++++++{
++++++++++++foreach+(Node+node+in+Edges)
++++++++++++{
++++++++++++++++if+(node.Value+==+val)
++++++++++++++++++++return+node;
++++++++++++}
++++++++++++foreach+(Node+node+in+Edges)
++++++++++++{
++++++++++++++++Node+result+=+node.FindRecursiveBreadthFirst(val);
++++++++++++++++if+(result+!=+null)
++++++++++++++++++++return+result;
++++++++++++}
++++++++++++return+null;
++++++++}
++++++++public+Node+FindRecursiveDepthFirst(int+val)
++++++++{
++++++++++++if+(Value+==+val)
++++++++++++++++return+this;
++++++++++++else
++++++++++++{
++++++++++++++++foreach+(Node+node+in+Edges)
++++++++++++++++{
++++++++++++++++++++Node+result+=+node.FindRecursiveDepthFirst(val);
++++++++++++++++++++if+(result+!=+null)
++++++++++++++++++++++++return+result;
++++++++++++++++}
++++++++++++++++return+null;
++++++++++++}
++++++++}
++++}
}|code-block|syntax|javascript|715064|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

If you only need the most basic functionality, then build your own data structure.

I did a quick implementation of a basic tree (directional edges and not necessarily binary tree), assuming you have a fixed root node. I also added methods for searching depth first and breadth first.

<pre><code>using System;
using System.Collections.Generic;
namespace TreeTest
{
 class Program
 {
 static void Main(string[] args)
 {
 //Build example tree
 Tree tree = new Tree();
 Node a = new Node(2);
 Node b = new Node(7);
 Node c = new Node(2);
 Node d = new Node(6);
 Node e = new Node(5);
 Node f = new Node(11);
 Node g = new Node(5);
 Node h = new Node(9);
 Node i = new Node(4);

 tree.rootNode = a;
 a.Edges.Add(b);
 b.Edges.Add(c);
 b.Edges.Add(d);
 d.Edges.Add(e);
 d.Edges.Add(f);
 a.Edges.Add(g);
 g.Edges.Add(h);
 h.Edges.Add(i);

 //Find node scannin tree from top down
 Node node = tree.FindByValueBreadthFirst(6);
 Console.WriteLine(node != null ? "Found node" : "Did not find node");

 //Find node scanning tree branch for branch.
 node = tree.FindByValueDepthFirst(2);
 Console.WriteLine(node != null ? "Found node" : "Did not find node");

 Console.WriteLine("PRESS ANY KEY TO EXIT");
 Console.ReadKey();
 }
 }
 class Tree
 {
 public Node rootNode;
 public Node FindByValueDepthFirst(int val)
 {
 return rootNode.FindRecursiveDepthFirst(val);
 }
 public Node FindByValueBreadthFirst(int val)
 {
 if (rootNode.Value == val)
 return rootNode;
 else
 return rootNode.FindRecursiveBreadthFirst(val);
 }
 }
 class Node
 {
 public int Value { get; set; }
 public IList&lt;Node&gt; Edges { get; set; }
 public Node(int val)
 {
 Value = val;
 Edges = new List&lt;Node&gt;(2);
 }
 public Node FindRecursiveBreadthFirst(int val)
 {
 foreach (Node node in Edges)
 {
 if (node.Value == val)
 return node;
 }
 foreach (Node node in Edges)
 {
 Node result = node.FindRecursiveBreadthFirst(val);
 if (result != null)
 return result;
 }
 return null;
 }
 public Node FindRecursiveDepthFirst(int val)
 {
 if (Value == val)
 return this;
 else
 {
 foreach (Node node in Edges)
 {
 Node result = node.FindRecursiveDepthFirst(val);
 if (result != null)
 return result;
 }
 return null;
 }
 }
 }
}
</code></pre>

I have been struggling for days finding .NET <code>Tree Data Structure</code>, I have read many recomendation using <a href="http://www.itu.dk/research/c5/" rel="nofollow noreferrer">C5 library</a>, but I have yet find example for it.

<img src="https://i.stack.imgur.com/HDVtw.png" alt="Basic Tree">

I have read C5 documentation but didn't find example for it (I admit I haven't read all documentation page).

<code>Edit: I need a Tree with basic functionality like search from parent to child node and vice versa.</code>

Using C5 Collection Tree Data Structure

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

几天来我一直在努力寻找.NET Tree Data Structure，我已经阅读了很多使用的建议，但我还没有找到它的例子。​​我已经阅读了C5文档，但是没有找到它的示例(我承认我没有读过所有的文档页面)。Edit: I need a Tree with basic functionality like search ...

问使用C5收集树数据结构
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用C5收集树数据结构EN