Book Image

C# Data Structures and Algorithms - Second Edition

By : Marcin Jamro
Book Image

C# Data Structures and Algorithms - Second Edition

By: Marcin Jamro

Overview of this book

Building your own applications is exciting but challenging, especially when tackling complex problems tied to advanced data structures and algorithms. This endeavor demands profound knowledge of the programming language as well as data structures and algorithms – precisely what this book offers to C# developers. Starting with an introduction to algorithms, this book gradually immerses you in the world of arrays, lists, stacks, queues, dictionaries, and sets. Real-world examples, enriched with code snippets and illustrations, provide a practical understanding of these concepts. You’ll also learn how to sort arrays using various algorithms, setting a solid foundation for your programming expertise. As you progress through the book, you’ll venture into more complex data structures – trees and graphs – and discover algorithms for tasks such as determining the shortest path in a graph before advancing to see various algorithms in action, such as solving Sudoku. By the end of the book, you’ll have learned how to use the C# language to build algorithmic components that are not only easy to understand and debug but also seamlessly applicable in various applications, spanning web and mobile platforms.
Table of Contents (13 chapters)

Variants of Trees

In the previous chapters, you learned about many data structures, starting with simple ones such as arrays. Now, it is time for you to get to know a significantly more complex group of data structures, namely trees.

At the beginning of this chapter, a basic tree will be presented, together with its implementation in the C# language, and with some examples showing it in action. Then, a binary tree will be introduced, with a detailed description of its implementation and an example of its application. A binary search tree (BST) is another tree variant and is one of the most popular types of trees, used in many algorithms. You will also cover self-balancing trees, namely AVL and red-black trees (RBTs). Then, you will see a trie as a specialized data structure for performing operations on strings. The remaining part of the chapter is dedicated to a short introduction to the topic of heaps.

Arrays, lists, stacks, queues, dictionaries, sets, and now trees. Are you...