Tree and Collection Implementations

Description

This repository contains comprehensive implementations of various data structures and algorithms in C#. It includes:

• Tree Data Structures: General trees and binary trees with multiple traversal methods (PreOrder, PostOrder, InOrder).
• Collection Interfaces: Implementations of IEnumerable, IList, IDictionary, ISet, and ICollection with relevant methods.
• Sorting Algorithms: Implementations of linear and bubble sort algorithms.

Contents

• Binary Tree

  • Traversal Methods: PreOrder, PostOrder, InOrder

• General Tree

  • Includes methods such as Find operation

• ICollection

• IComparable

  • Includes methods to compare two instances

• IDictionary

• IEnumerable

  • Includes methods like Print and IsEmpty

• IList

• ISet

• Sorting Algorithms

  • Linear Sort
  • Bubble Sort