C# (CSharp) LeetCodeProblems.TreeProblems.Leetcode_230_KthSmallestElementInBST Node230V1 Beispiele

Beispiel #1

 public void Insert(int value)
 {
     if (Root == null)
     {
         Root = new Node230V1 {
             Value = value
         };
     }
 }

Beispiel #2

        private Node230V1 Insert(Node230V1 node, int value)
        {
            if (node == null)
            {
                return(new Node230V1 {
                    Value = value
                });
            }

            if (value > node.Value)
            {
                node.Right = Insert(node.Right, value);
            }
            else
            {
                //node.Left = Insert(node)
            }

            return(null);
        }