[Fork] [Y12Task2] Binary Tree | C# Online Compiler

[Fork] [Y12Task2] Binary Tree by M Gowen

using System;
					
public class Program
{
	public class binarytree
	{
		public class node
		{ // Single element of tree (node)
			public string data;
			public node leftPointer;
			public node rightPointer;
		}

		public node root;

		public bool add(string item)
		{
			try //in case of memory overflow (full)
			{
				// store new item in memory and start looking from root of tree
				node newNode = new node();
				newNode.data = item;
				newNode.leftPointer = null;
				newNode.rightPointer = null;
				node currentNode = root;
				//Case that tree is empty
				if (currentNode == null)
				{
					root = newNode;
					return true;
				}
				else
				{
					//work out where to put new item, by traversing tree until we find a left
					node previous = currentNode;
					while (currentNode != null)
					{
						previous = currentNode;
						//compareTo compares two strings, returns val <0 if lower
						if (item.CompareTo(currentNode.data) < 0)
						{
							currentNode = currentNode.leftPointer;
						}
						else
						{
							currentNode = currentNode.rightPointer;
						}
					}
					if (item.CompareTo(previous.data)<0)
					{
						previous.leftPointer = newNode;
					}
					else
					{
						previous.rightPointer = newNode;
					}
					return true;
				}
			}
			catch
			{
				return false;
			}
		}
		
		public bool delete(string item)
		{
			node current = root;
			node previous = null;
			//find the node with 'item' in it
			while ((current != null) && (current.data != item))
			{
				previous = current;
				if (item.CompareTo(current.data)<0)
				{
					current = current.leftPointer;
				}
				else
				{
					current = current.rightPointer;
				}
			}
			
			//Identify three cases, based on two, one or no child nodes from item
			if (current != null)
			{
				if (previous != null)
				{
					if ((current.leftPointer == null)&&(current.rightPointer==null))
					{
						//Node being deleted has no child nodes
						if (previous.data.CompareTo(current.data)>0)
						{
							previous.leftPointer = null;
						}
						else
						{
							previous.rightPointer = null;
						}
					}// Node has one child node on the left
					else if (current.rightPointer==null)
					{
						if (previous.data.CompareTo(current.data)>0)
						{
							previous.leftPointer = current.leftPointer;
						}
						else
						{
							previous.rightPointer = current.leftPointer;
						}
					}// Node has one child node on the right
					else if (current.leftPointer==null)
					{
						if (previous.data.CompareTo(current.data)<0)
						{
							previous.leftPointer = current.rightPointer;
						}
						else
						{
							previous.rightPointer = current.rightPointer;
						}
					}
					else //Node has two children
					{
						node rightNode = current.rightPointer;
						if (rightNode.leftPointer != null)
						{
							node smallest = rightNode;
							while (smallest.leftPointer != null)
							{
								previous = smallest;
								smallest = smallest.leftPointer;
							}
							//change the deleted node value to the smallest value
							current.data = smallest.data;
							//remove the successor
							previous.leftPointer = null;
						}
						else
						{//case where no left subtree from right node
							current.data = rightNode.data;
							current.rightPointer = null;
						}
					}
					return true;
				}
				else
				{
					return false;
				}
			}
			else
			{
				return false;
			}
		}

		
	}
	
	
	public static void Main()
	{
		binarytree bt = new binarytree();
		bt.add("I am root");
		bt.add("Avengers");
		bt.add("Marvel");
		bt.delete("Avengers");
		bt.add("Guardians");
		Console.WriteLine("Root: " + bt.root.data);
		Console.WriteLine("Root/Left Branch: " + bt.root.leftPointer.data);
		Console.WriteLine("Root/Right Branch: " + bt.root.rightPointer.data);
	}
}

​x
 
using System;
                    
public class Program
{
    public class binarytree
    {
        public class node
        { // Single element of tree (node)
            public string data;
            public node leftPointer;
            public node rightPointer;
        }
​
        public node root;
​
        public bool add(string item)
        {
            try //in case of memory overflow (full)
            {
                // store new item in memory and start looking from root of tree
                node newNode = new node();
                newNode.data = item;
                newNode.leftPointer = null;
                newNode.rightPointer = null;
                node currentNode = root;
                //Case that tree is empty
                if (currentNode == null)
                {
                    root = newNode;
                    return true;
                }
                else
                {
                    //work out where to put new item, by traversing tree until we find a left
                    node previous = currentNode;
                    while (currentNode != null)
                    {
                        previous = currentNode;
                        //compareTo compares two strings, returns val <0 if lower
                        if (item.CompareTo(currentNode.data) < 0)
                        {
                            currentNode = currentNode.leftPointer;
                        }
                        else
                        {
                            currentNode = currentNode.rightPointer;
                        }
                    }
                    if (item.CompareTo(previous.data)<0)
                    {
                        previous.leftPointer = newNode;
                    }
                    else
                    {
                        previous.rightPointer = newNode;
                    }
                    return true;
                }
            }
            catch
            {
                return false;
            }
        }
        
        public bool delete(string item)
        {
            node current = root;
            node previous = null;
            //find the node with 'item' in it
            while ((current != null) && (current.data != item))
            {
                previous = current;
                if (item.CompareTo(current.data)<0)
                {
                    current = current.leftPointer;
                }
                else
                {
                    current = current.rightPointer;
                }
            }
            
            //Identify three cases, based on two, one or no child nodes from item
            if (current != null)
            {
                if (previous != null)
                {
                    if ((current.leftPointer == null)&&(current.rightPointer==null))
                    {
                        //Node being deleted has no child nodes
                        if (previous.data.CompareTo(current.data)>0)
                        {
                            previous.leftPointer = null;
                        }
                        else
                        {
                            previous.rightPointer = null;
                        }
                    }// Node has one child node on the left
                    else if (current.rightPointer==null)
                    {
                        if (previous.data.CompareTo(current.data)>0)
                        {
                            previous.leftPointer = current.leftPointer;
                        }
                        else
                        {
                            previous.rightPointer = current.leftPointer;
                        }
                    }// Node has one child node on the right
                    else if (current.leftPointer==null)
                    {
                        if (previous.data.CompareTo(current.data)<0)
                        {
                            previous.leftPointer = current.rightPointer;
                        }
                        else
                        {
                            previous.rightPointer = current.rightPointer;
                        }
                    }
                    else //Node has two children
                    {
                        node rightNode = current.rightPointer;
                        if (rightNode.leftPointer != null)
                        {
                            node smallest = rightNode;
                            while (smallest.leftPointer != null)
                            {
                                previous = smallest;
                                smallest = smallest.leftPointer;
                            }
                            //change the deleted node value to the smallest value
                            current.data = smallest.data;
                            //remove the successor
                            previous.leftPointer = null;
                        }
                        else
                        {//case where no left subtree from right node
                            current.data = rightNode.data;
                            current.rightPointer = null;
                        }
                    }
                    return true;
                }
                else
                {
                    return false;
                }
            }
            else
            {
                return false;
            }
        }
​
        
    }
    
    
    public static void Main()
    {
        binarytree bt = new binarytree();
        bt.add("I am root");
        bt.add("Avengers");
        bt.add("Marvel");
        bt.delete("Avengers");
        bt.add("Guardians");
        Console.WriteLine("Root: " + bt.root.data);
        Console.WriteLine("Root/Left Branch: " + bt.root.leftPointer.data);
        Console.WriteLine("Root/Right Branch: " + bt.root.rightPointer.data);
    }
}

Cached Result
Last Run:	4:31:57 pm
Compile:	0.097s
Execute:	0.014s
Memory:	0b
CPU:	0.016s

View IL Code