[Fork] my task | C# Online Compiler

[Fork] my task by walker_code

using System;

namespace ask
{
	public class Node
	{
		public int data;
		public Node right, left;
		public Node(int x)
		{
			data = x;
			left = right = null;
		}
	}

	class Bst
	{
		public Node Insert(Node root, int x)
		{
			Node current = root;
			Node parent = null;
			if (root == null)
			{
				return new Node(x);
			}

			while (current != null)
			{
				parent = current;
				if (current.data > x)
				{
					current = current.left;
				}
				else
				{
					current = current.right;
				}
			}

			if (x < parent.data)
			{
				parent.left = new Node(x);
			}
			else
			{
				parent.right = new Node(x);
			}

			return root;
		}

		public bool Search(Node root, int x)
		{
			while (root != null)
			{
				if (root.data == x)
				{
					return true;
				}
				else if (root.data > x)
				{
					root = root.left;
				}
				else
				{
					root = root.right;
				}
			}

			return false;
		}

		public void PrintOrder(Node root, int size, int order)
		{
			int[] a = new int[size];
			int p = 0;
			Node current, pre;
			if (root == null)
			{
				return;
			}

			current = root;
			while (current != null)
			{
				if (current.left == null)
				{
					a[p++] = current.data;
					current = current.right;
				}
				else
				{
					pre = current.left;
					while (pre.right != null && pre.right != current)
					{
						pre = pre.right;
					}

					if (pre.right == null)
					{
						pre.right = current;
						current = current.left;
					}
					else
					{
						pre.right = null;
						a[p++] = current.data;
						current = current.right;
					}
				}
			}

			if (order == 0)
			{
				for (int i = 0; i < size; i++)
				{
					Console.Write(a[i] + " ");
				}

				Console.WriteLine();
			}
			else
			{
				for (int i = size - 1; i >= 0; i--)
				{
					Console.Write(a[i] + " ");
				}
			}
		}
	}

	public class Program
	{
		public static void Main()
		{
			Bst bstObj = new Bst();
			Node root = null;
			int size = 0;
			while (true)
			{
				Console.WriteLine("Enter your choice\n 1.Insert \n 2.Search \n 3.Ascending order \n 4.Descending order\n 5.Exit \n");
				int choice = Convert.ToInt32(Console.ReadLine());
				switch (choice)
				{
					case 1:
						Console.WriteLine("enter the value to insert");
						int number = Convert.ToInt32(Console.ReadLine());
						root = bstObj.Insert(root, number);
						size++;
						break;
					case 2:
						Console.WriteLine("Enter a number to search");
						number = Convert.ToInt32(Console.ReadLine());
						if (bstObj.Search(root, number))
						{
							Console.WriteLine("element is present");
						}
						else
						{
							Console.WriteLine("Element is not available");
						}

						break;
					case 3:
						Console.WriteLine("Ascending order");
						bstObj.PrintOrder(root, size, 0);
						break;
					case 4:
						Console.WriteLine("Descending Order");
						bstObj.PrintOrder(root, size, 1);
						break;
					case 5:
						Console.WriteLine("Exiting...");
						System.Environment.Exit(0);
						break;
					default:
						Console.WriteLine("\nEnter correct choice");
						break;
				}
			}
		}
	}
}

​x
 
using System;
​
namespace ask
{
    public class Node
    {
        public int data;
        public Node right, left;
        public Node(int x)
        {
            data = x;
            left = right = null;
        }
    }
​
    class Bst
    {
        public Node Insert(Node root, int x)
        {
            Node current = root;
            Node parent = null;
            if (root == null)
            {
                return new Node(x);
            }
​
            while (current != null)
            {
                parent = current;
                if (current.data > x)
                {
                    current = current.left;
                }
                else
                {
                    current = current.right;
                }
            }
​
            if (x < parent.data)
            {
                parent.left = new Node(x);
            }
            else
            {
                parent.right = new Node(x);
            }
​
            return root;
        }
​
        public bool Search(Node root, int x)
        {
            while (root != null)
            {
                if (root.data == x)
                {
                    return true;
                }
                else if (root.data > x)
                {
                    root = root.left;
                }
                else
                {
                    root = root.right;
                }
            }
​
            return false;
        }
​
        public void PrintOrder(Node root, int size, int order)
        {
            int[] a = new int[size];
            int p = 0;
            Node current, pre;
            if (root == null)
            {
                return;
            }
​
            current = root;
            while (current != null)
            {
                if (current.left == null)
                {
                    a[p++] = current.data;
                    current = current.right;
                }
                else
                {
                    pre = current.left;
                    while (pre.right != null && pre.right != current)
                    {
                        pre = pre.right;
                    }
​
                    if (pre.right == null)
                    {
                        pre.right = current;
                        current = current.left;
                    }
                    else
                    {
                        pre.right = null;
                        a[p++] = current.data;
                        current = current.right;
                    }
                }
            }
​
            if (order == 0)
            {
                for (int i = 0; i < size; i++)
                {
                    Console.Write(a[i] + " ");
                }
​
                Console.WriteLine();
            }
            else
            {
                for (int i = size - 1; i >= 0; i--)
                {
                    Console.Write(a[i] + " ");
                }
            }
        }
    }
​
    public class Program
    {
        public static void Main()
        {
            Bst bstObj = new Bst();
            Node root = null;
            int size = 0;
            while (true)
            {
                Console.WriteLine("Enter your choice\n 1.Insert \n 2.Search \n 3.Ascending order \n 4.Descending order\n 5.Exit \n");
                int choice = Convert.ToInt32(Console.ReadLine());
                switch (choice)
                {
                    case 1:
                        Console.WriteLine("enter the value to insert");
                        int number = Convert.ToInt32(Console.ReadLine());
                        root = bstObj.Insert(root, number);
                        size++;
                        break;
                    case 2:
                        Console.WriteLine("Enter a number to search");
                        number = Convert.ToInt32(Console.ReadLine());
                        if (bstObj.Search(root, number))
                        {
                            Console.WriteLine("element is present");
                        }
                        else
                        {
                            Console.WriteLine("Element is not available");
                        }
​
                        break;
                    case 3:
                        Console.WriteLine("Ascending order");
                        bstObj.PrintOrder(root, size, 0);
                        break;
                    case 4:
                        Console.WriteLine("Descending Order");
                        bstObj.PrintOrder(root, size, 1);
                        break;
                    case 5:
                        Console.WriteLine("Exiting...");
                        System.Environment.Exit(0);
                        break;
                    default:
                        Console.WriteLine("\nEnter correct choice");
                        break;
                }
            }
        }
    }
}

Teen age Students:
John
Bill
Ron

Last Run:	6:43:56 am
Compile:	0.127s
Execute:	0.007s
Memory:	8kb
CPU:	0.016s

View IL Code