如何打印第一个孩子 - 兄弟姐妹结构

Question

我想弄清楚如何打印第一个孩子下一个兄弟姐妹树。我想是这样的：

root 
| 
firstChild - sibling - sibling 
         | 
         child - sibling - sibling 

我有下面的代码添加孩子的兄弟姐妹：

class Program 
{ 
    static void Main(string[] args) 
    { 
     GeneralTree<string> tree = new GeneralTree<string>(); 
     tree.root = new TreeNode<string> 
     { 
      Data = "Root" 
     }; 
     TreeNode<string> child = tree.addChild(tree.root, "Child"); 
     tree.addSibling(child, "Sibling"); 
     tree.print(tree.root); 
    } 
} 
class GeneralTree<T> 
{ 
    public TreeNode<T> root; 

    public TreeNode<T> addChild(TreeNode<T> parent, T data) 
    { 
     parent.FirstChild = new TreeNode<T> 
     { 
      Data = data, 
      NextSibling = parent.FirstChild 
     }; 
     return parent.FirstChild; 
    } 
    public TreeNode<T> addSibling(TreeNode<T> sibling, T data) 
    { 
     sibling.NextSibling = new TreeNode<T> 
     { 
      Data = data, 
      FirstChild = sibling.NextSibling 
     }; 
     return sibling.NextSibling; 
    } 

    int count = 0; 
    public void print(TreeNode<T> Node) 
    { 

     if(Node !=null) 
     { 
      Console.WriteLine(Node.Data); 
      print(Node.FirstChild); 
      ++count; 
      Console.WriteLine(count); 
      print(Node.NextSibling); 
     } 
    } 
} 
class TreeNode<T> 
{ 
    public T Data { get; set; } 
    public TreeNode<T> FirstChild { get; set; } 
    public TreeNode<T> NextSibling { get; set; } 
} 

现在有没有人如何打印出来？

在此先感谢！

Answer 1

我选用合并TreeNode和GeneralTree这样：

public class TreeNode<T> 
{ 

    public T data; 
    public List<TreeNode<T>> childs; 

    public TreeNode<T> firstChild() 
    {return childs.get(0);} 

    public void appendChild(TreeNode<T> child) 
    {childs.add(child);} 

    public void print() {/* ... */} 

    /* ... */ 

    public static void main(String args[]) 
    { /* ... */} 
} 

然后，方法写print()递归：

public void print() 
    { 
     print(0);  
    } 

    public void print(int offset) 
    { 
     if (node == null) return; // nothing to print anymore 

     System.out.println(this.data); // printing the root data 

     TreeNode<T> lastChild=null; 
     String output = ""; 
     for(Iterator<TreeNode<T>> i = childs.iterator(); i.hasNext();) 
     { 
      lastChild = i.next(); 
      if (output != "") output += " - "; 
      output += lastChild.data; 
     } 

     // length will be the next line offset 
     // (size of the current line output minus last item length 

     int length = output.length()-lastChild.toString().length; 
     // use a repeat() string function like this one : 
     output = org.apache.commons.lang.StringUtils.repeat(" ", length) + (length>0?"|":"") + output; 
     System.out.println (output); 
     lastChild.print(length); 
    } 

} 

不幸的是我无法验证我的代码现在，如果你有问题，请让我知道。