C#分別用前序遍歷、中序遍歷和后序遍歷打印二叉樹

public class BinaryTreeNode
{
    public BinaryTreeNode Left { get; set; }
 
    public BinaryTreeNode Right { get; set; }
 
    public int Data { get; set; }
 
    public BinaryTreeNode(int data)
    {
        this.Data = data;
    }
}
 
    public enum TreeTraversal
    {
        PREORDER,
        INORDER,
        POSTORDER
    }
 
    public void PrintTree(BinaryTreeNode root, TreeTraversal treeTraversal)
    {
        Action<int> printValue = delegate(int v)
        {
            Console.Write(v + " ");
        };
     
        switch (treeTraversal)
        {
            case TreeTraversal.PREORDER:
                PreOrderTraversal(printValue, root);
                break;
            case TreeTraversal.INORDER:
                InOrderTraversal(printValue, root);
                break;
            case TreeTraversal.POSTORDER:
                PostOrderTraversal(printValue, root);
                break;
            default: break;
        }
    }
 
    public void PreOrderTraversal(Action<int> action, BinaryTreeNode root)
    {
        if (root == null)
            return;
 
        action(root.Data);
        PreOrderTraversal(action, root.Left);
        PreOrderTraversal(action, root.Right);
    }
 
    public void InOrderTraversal(Action<int> action, BinaryTreeNode root)
    {
        if (root == null)
            return;
 
        InOrderTraversal(action, root.Left);
        action(root.Data);
        InOrderTraversal(action, root.Right);
    }
 
    public void PostOrderTraversal(Action<int> action, BinaryTreeNode root)
    {
        if (root == null)
            return;
 
        PostOrderTraversal(action, root.Left);
        PostOrderTraversal(action, root.Right);
        action(root.Data);
    }      

標簽：

版權申明：本站文章部分自網(wǎng)絡，如有侵權，請聯(lián)系：west999com@outlook.com
特別注意：本站所有轉載文章言論不代表本站觀點！
本站所提供的圖片等素材，版權歸原作者所有，如需使用，請與原作者聯(lián)系。