AI coding assistant for busy programmers

All

JavaScript

How to convert a sorted list to a binary search tree in C#

C#

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

namespace ConsoleApplication1
{

public class Node<T> where T : IComparable<T>
    {

public Node(T value) { Value = value; }

public T Value { get; set; }

public Node<T> Left { get; set; }

public Node<T> Right { get; set; }

}

class Program
    {

static void Main(string[] args)
        {

var list = new List<int>() { 1, 2, 3, 4, 5, 6 }; // sorted list of integers

var root = ConvertToBST(list); // convert the list to a binary search tree

Console.WriteLine("Done"); // print "Done" to the console

Console.ReadKey(); // wait for a key press

}

private static Node<int> ConvertToBST(List<int> list)
        {

if (list == null || !list.Any()) return null; // if the list is empty or null return null

var mid = (list.Count - 1) / 2; // find the middle element of the list

var node = new Node<int>(list[mid]); // create a new node with the middle element as its value

node.Left = ConvertToBST(list.Take(mid).ToList()); // recursively call this method on the left half of the list and assign it to be left child of this node

node.Right = ConvertToBST(list.Skip(mid + 1).ToList()); // recursively call this method on the right half of the list and assign it to be right child of this node

return node; // return this node as it is now a BST with all its children being BSTs too!  									   /* Time Complexity: O(n log n) */ /* Space Complexity: O(n) */ /* Note: This code has not been tested on LeetCode or any other online judge */ /* Note: This code might contain bugs as it is part of an interview question and has not been tested thoroughly */ /* Note: Any bug reports are welcome :) */

​x
 
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
​
namespace ConsoleApplication1
{
​
    public class Node<T> where T : IComparable<T>
    {
​
        public Node(T value) { Value = value; }
​
        public T Value { get; set; }
​
        public Node<T> Left { get; set; }
​
        public Node<T> Right { get; set; }
​
    }

🤖 Code Explanation

}

}

}

This code converts a sorted list of integers into a binary search tree. The binary search tree will have the middle element of the list as its root node. The left and right children of the root node will be binary search trees with the elements of the left and right halves of the list, respectively.

AI coding assistant for busy programmers

How to convert a sorted list to a binary search tree in C#

C#

🤖 Code Explanation

More problems solved in C#