Generic Binary Tree : Generic Tree « Generics « C# / C Sharp

Home
C# / C Sharp
1.2D Graphics
2.Class Interface
3.Collections Data Structure
4.Components
5.Data Types
6.Database ADO.net
7.Design Patterns
8.Development Class
9.Event
10.File Stream
11.Generics
12.GUI Windows Form
13.Language Basics
14.LINQ
15.Network
16.Office
17.Reflection
18.Regular Expressions
19.Security
20.Services Event
21.Thread
22.Web Services
23.Windows
24.Windows Presentation Foundation
25.XML
26.XML LINQ
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source
C# / C Sharp » Generics » Generic TreeScreenshots 
Generic Binary Tree
 

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;


public class Tree<TItem> where TItem : IComparable<TItem> {
    public Tree(TItem nodeValue) {
        this.NodeData = nodeValue;
        this.LeftTree = null;
        this.RightTree = null;
    }

    public void Insert(TItem newItem) {
        TItem currentNodeValue = this.NodeData;
        if (currentNodeValue.CompareTo(newItem0) {
            if (this.LeftTree == null) {
                this.LeftTree = new Tree<TItem>(newItem);
            else {
                this.LeftTree.Insert(newItem);
            }
        else {
            if (this.RightTree == null) {
                this.RightTree = new Tree<TItem>(newItem);
            else {
                this.RightTree.Insert(newItem);
            }
        }
    }

    public void WalkTree() {
        if (this.LeftTree != null) {
            this.LeftTree.WalkTree();
        }

        Console.WriteLine(this.NodeData.ToString());

        if (this.RightTree != null) {
            this.RightTree.WalkTree();
        }
    }

    public TItem NodeData get; set; }
    public Tree<TItem> LeftTree get; set; }
    public Tree<TItem> RightTree get; set; }
}



class Program {
    static void Main(string[] args) {
        Tree<char> charTree = new Tree<char>('M');
        InsertIntoTree<char>(charTree, 'X''A''M''Z''Z''N');
        charTree.WalkTree();
    }

    static void InsertIntoTree<T>(Tree<T> tree, params T[] datawhere T : IComparable<T> {
        if (data.Length == 0)
            throw new ArgumentException("Must provide at least one data value");

        foreach (T datum in data) {
            tree.Insert(datum);
        }
    }
}

 
Related examples in the same category
1.Generic TreeNode
2.Walk through a tree recursively
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.