C# Version HisotryC# Language FeaturesInstalling Visual StudioC# Basic Project StructureHello Wolrd, first C# program
Variables in C# Explicitly typed variables in C#Implicitly typed variables in C#Constants in C#Data types in C#Integral data types in C#Floating-point data types in C#Comparison between Float, Double and DecimalChar data type in C#String data type in C#Boolean data type in C#DateTime data type in C#Enumeration data type in C#Array data type in C#Object data type in C#Dynamic data type in C#Anonymous data type in C#Nullable data type in C#Type casting in C#Type safety in C#Literals in C#Operators in C#Ternary Operator in C#Null coalescing Operator in C#Tilde(~) Operator in C#Keywords in C#Namespace in C#Nullable Types in C#Nullable Helper Class in C#Characteristics of Nullable typesC# Difference between "int" and "int?"
Block statement in C#Empty statement in C#Jump statements in C#Break statement in C#Continue statement in C#Difference between continue and breakGoto statement in C#Return statement in C#Throw statement in C#Yield keyword in C#Checked statement in C#Unchecked statement in C#Lock statement in C#Using statement in C#Enum/Enumeration in C#If-Else statement in C#Switch statement in C#What is a loop in C#?For loop in C#While loop in C#Do while loop in C#Foreach loop in C#Nested loop in C#Infinite loop in C#
C# Method or FunctionC# Method Parameters and ArgumentsC# Method OverloadingC# Return StatementsC# Static vs. Instance MethodsC# Method ModifiersC# Method Signatures and Naming ConventionsC# Function Documentation and CommentsC# Value Type ParametersC# Ref Type ParametersDifference between Value and Ref TypeC# Out ParametersDifference between Ref and out parametersC# Optional parametersAre Nullable types reference types in C#"
Exception Handling in C#Types of exception in C#Try catch finally in C#finally block in C#try block without catch blockMultiple catch blocks in exceptionCatch multiple exceptions in C#Base class of exception in C#finally block execution in C#finally block execution in case of errorFinally and return statementWays to use try-catch-finallyException throw from finally block"throw" and "throw ex" in C#Differene between finalize() and finallyInner exception in C#Error types in C#Catch multi exception by single catch blockUser defined/custom excetion in C#Compile and run time exception in C#Difference between "error" and "exception"System and application exception in C#Exception handling abuse in c#?
C# String BasicsC# String ManipulationC# String FormattingC# String Comparison and SearchingC# StringBuilder ClassC# Regular ExpressionsC# Unicode and EncodingC# String Parsing and ConversionDifference between "string" and "String"C# String Escape SequenceC# Mutable and Immutable ConceptProve that string is immutableString value stored in memoryDifference between string and stringbuilderOverride the tostring() method
Enum/enumeration in C#Can you inherit enum in C#?Convert enum to stringConvert enum to list in C#Cast int value to enum in C#Get int value from enum in C#Convert string to enum in C#Usage of enum in switch case statementLoop through all enum valuesUse tilde(~) with Enum
Main() method basics in C#More than one "Main()" method in C#Static Main() method in C#Overload Main() method in C#Override Main() method in C#Access modifiers of Main() method in C#Non-static method in C#Main() method arguments and return typeasync Main() method in C#Class without Main() method in C#Main() method rules in C#
Recursion in C#Base condition in recursion in C#Recursive Algorithms in C#Tree traversal using recursion in C#Stack overflow error in recursionBack tracking using recursionIndirect recursion in C#Recursive data structures in C#Tail Recursion in C#Recursive problem solvingRecursion vs Iteration
C# File and File InfoC# StreamReader and StreamWriterC# FileStream and BinaryReader/BinaryWriterC# Directory and DirectoryInfo ClassesC# File PathsC# File and Directory OperationsC# File Exceptions and Error HandlingC# File Serialization and DeserializationC# File System Watcher
What is array?Single dimension arrayMulti dimension arrayJagged arrayParam arrayArray with multi data typesDifferent data types from object arrayArray with non-default valuesArray methods and propertiesArray manipulation techniquesArray sorting algorithmsArray Searching algorithms(linear, binary search)Array finding maximum and minimumArray of Reference Types
C# GenericsC# Generic Constraints
C# ArrayListC# Array vs ArrayListC# ListC# SortedListC# DictionaryC# HashtableC# Dictionary vs HashtableC# HashSetC# Hashtable vs HashSetC# StackC# Queue
C# IEnumerableC# IEnumeratorC# ICollectionC# IListC# IDictionaryC# IDisposableC# IComparableC# IEquatableC# ICloneableC# IQueryableC# INotifyPropertyChangedC# INotifyCollectionChangedC# IFormattableC# IAsyncResultC# IComparerC# IEqualityComparerC# IHttpHandlerC# IHttpModule
C# DelegatesC# Single-Cast DelegateC# Multi-Cast DelegateC# Generic DelegatesC# Func DelegateC# Action DelegateC# Predicate DelegateC# Anonymous MethodsC# EventsDifference Between Event & DelegateDifference Between Interface & DelegateC# Covariance and Contravariance
Previous
Next

C# - Recursive Data Structures

Recursive data structures are data structures that contain references to instances of the same type within themselves. These structures create a kind of tree-like arrangement or hierarchical relationship, where each individual part can have smaller parts of the same kind, making a repeating pattern. Linked lists and trees are the two most common examples of recursive data structures.

Recursive Data Structure: Linked List

A linked list in C# is a data structure used to store a collection of elements, where each element (node) contains both the data and a reference (link) to the next element in the list. Linked lists are dynamic in size and allow for efficient insertion and removal of elements at any position within the list. The concept of a linked list exhibits inherent recursion, as it involves nodes, each of which holds a reference to another node within the linked list structure. 


public class Node
{
    public int data;
    public Node next;

    public Node(int data)
    {
        this.data = data;
        this.next = null;
    }
}

Recursive Data Structure: Trees

Trees are hierarchical data structures and they are consist of nodes. These nodes connected by edges. Each node may or may not have child nodes, forming a recursive tree structure. One common type of tree is the binary tree, where each node has at most two child nodes: left and right. 


public class TreeNode
{
    public int val;
    public TreeNode left;
    public TreeNode right;

    public TreeNode(int val)
    {
        this.val = val;
        this.left = this.right = null;
    }
}

Recursive Operations on Data Structures:

Because recursive data structures use references to the same type of thing, people often use recursive actions to do things with these structures. These actions can include going through them, looking for something, putting something in, taking something out, and other similar tasks. Below are examples of recursive operations on linked lists and binary trees:

Recursive Traversal of a Linked List: 


public void PrintLinkedList(Node head)
{
    if (head == null)
        return;

    Console.Write(head.data + " ");
    PrintLinkedList(head.next);
}

Recursive Traversal of a Binary Tree (In-order Traversal): 


public void InOrderTraversal(TreeNode root)
{
    if (root == null)
        return;

    InOrderTraversal(root.left);
    Console.Write(root.val + " ");
    InOrderTraversal(root.right);
}

Recursive Search in a Linked List: 


public Node Search(Node head, int key)
{
    if (head == null || head.data == key)
        return head;

    return Search(head.next, key);
}

Recursive Search in a Binary Tree: 


public TreeNode Search(TreeNode root, int key)
{
    if (root == null || root.val == key)
        return root;

    if (key < root.val)
        return Search(root.left, key);
    else
        return Search(root.right, key);
}

Recursive Insertion in a Binary Search Tree: 


public TreeNode Insert(TreeNode root, int key)
{
    if (root == null)
        return new TreeNode(key);

    if (key < root.val)
        root.left = Insert(root.left, key);
    else
        root.right = Insert(root.right, key);

    return root;
}

In recursive operations, the function calls itself with a modified version of the data structure (e.g., head.next for linked lists or root.left or root.right for trees) to solve the problem for a smaller instance of the structure. Using recursive actions is a smart approach to handle recursive data structures, and they are frequently used in algorithms and when creating data structures.

Previous
Next