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.Date Time
8.Design Patterns
9.Development Class
10.Event
11.File Stream
12.Generics
13.GUI Windows Form
14.Internationalization I18N
15.Language Basics
16.LINQ
17.Network
18.Office
19.Reflection
20.Regular Expressions
21.Security
22.Services Event
23.Thread
24.Web Services
25.Windows
26.Windows Presentation Foundation
27.XML
28.XML LINQ
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
java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.