insert a Node in BST P | C# Online Compiler

insert a Node in BST P by Ayush_Agarwal

using System;

public class Program
{
	public class Node
	{
		public int data;
		public Node left;
		public Node right;
		public Node(int d)
		{
			data = d;
			left = right = null;
		}
	}

	public class Binarytree
	{
		public Node root;
		public Node createBST(int data, Node tnode)
		{
			if (tnode == null)
			{
				tnode.data = data;
				Console.WriteLine("enter{0}", tnode.data);
				return tnode;
			}
			else
			{
				if (data < tnode.data)
				{
					if (tnode.left == null)
					{
						tnode.left = new Node(data);
						return tnode;
					}
					else
					{
						createBST(data, tnode.left);
					}
				}
				else
				{
					if (tnode.right == null)
					{
						tnode.right = new Node(data);
						return tnode;
					}
					else
					{
						createBST(data, tnode.right);
					}
				}
			}

			return tnode;
		}

		public void inorder(Node tnode)
		{
			if (tnode != null)
			{
				inorder(tnode.left);
				Console.Write("{0},", tnode.data);
				inorder(tnode.right);
			}
		}

		public void insertnode(int t, Node tnode)
		{
		}
	}

	public static void Main()
	{
		Binarytree tree = new Binarytree();
		tree.root = new Node(2);
		tree.root.left = new Node(1);
		tree.root.right = new Node(3);
		tree.root.right.right = new Node(6);
		tree.createBST(4, tree.root);
		tree.inorder(tree.root);
	}
}

​x
 
using System;
​
public class Program
{
    public class Node
    {
        public int data;
        public Node left;
        public Node right;
        public Node(int d)
        {
            data = d;
            left = right = null;
        }
    }
​
    public class Binarytree
    {
        public Node root;
        public Node createBST(int data, Node tnode)
        {
            if (tnode == null)
            {
                tnode.data = data;
                Console.WriteLine("enter{0}", tnode.data);
                return tnode;
            }
            else
            {
                if (data < tnode.data)
                {
                    if (tnode.left == null)
                    {
                        tnode.left = new Node(data);
                        return tnode;
                    }
                    else
                    {
                        createBST(data, tnode.left);
                    }
                }
                else
                {
                    if (tnode.right == null)
                    {
                        tnode.right = new Node(data);
                        return tnode;
                    }
                    else
                    {
                        createBST(data, tnode.right);
                    }
                }
            }
​
            return tnode;
        }
​
        public void inorder(Node tnode)
        {
            if (tnode != null)
            {
                inorder(tnode.left);
                Console.Write("{0},", tnode.data);
                inorder(tnode.right);
            }
        }
​
        public void insertnode(int t, Node tnode)
        {
        }
    }
​
    public static void Main()
    {
        Binarytree tree = new Binarytree();
        tree.root = new Node(2);
        tree.root.left = new Node(1);
        tree.root.right = new Node(3);
        tree.root.right.right = new Node(6);
        tree.createBST(4, tree.root);
        tree.inorder(tree.root);
    }
}

Environment version: .NET 9.0.0 (9.0.0)
Newtonsoft.Json version: Newtonsoft.Json, Version=12.0.0.0, Culture=neutral, PublicKeyToken=30ad4fe6b2a6aeed

{"SomeArr":[{"prop1":"value1"},{"prop1":"value1"}]}
{"SomeArr":[{"prop1":"value1"},{"prop1":"value1"}]}
{"SomeArr":["a","b",null,"c"]}
{"SomeArr":["a","b",null,"c"]}

Cached Result
Last Run:	2:05:12 pm
Compile:	0.034s
Execute:	0.17s
Memory:	16.78Mb
CPU:	0.204s

View IL Code