C# (CSharp) ctci.Library TreeNode.SetLeftChild Examples

Example #1

File: TreeNode.cs Project: zs9912/ctci

        private static TreeNode CreateMinimalBst(int[] arr, int start, int end)
        {
            if (end < start)
            {
                return(null);
            }
            int      mid = (start + end) / 2;
            TreeNode n   = new TreeNode(arr[mid]);

            n.SetLeftChild(CreateMinimalBst(arr, start, mid - 1));
            n.SetRightChild(CreateMinimalBst(arr, mid + 1, end));
            return(n);
        }

Example #2

File: TreeNode.cs Project: j316chuck/Exploration

        private static TreeNode CreateMinimalBst(int[] array, int start, int end)
        {
            if (end < start)
            {
                return(null);
            }

            var mid      = (start + end) / 2;
            var treeNode = new TreeNode(array[mid]);

            treeNode.SetLeftChild(CreateMinimalBst(array, start, mid - 1));
            treeNode.SetRightChild(CreateMinimalBst(array, mid + 1, end));

            return(treeNode);
        }

Example #3

File: TreeNode.cs Project: yusufbs/CtCI-6th-Edition-CSharp

        private static TreeNode CreateMinimalBst(int[] array, int start, int end)
        {
            if (end < start)
            {
                return null;
            }

            var mid = (start + end) / 2;
            var treeNode = new TreeNode(array[mid]);
            treeNode.SetLeftChild(CreateMinimalBst(array, start, mid - 1));
            treeNode.SetRightChild(CreateMinimalBst(array, mid + 1, end));

            return treeNode;
        }

Example #4

File: TreeNode.cs Project: 0x0all/ctci

	    private static TreeNode CreateMinimalBst(int[] arr, int start, int end)
        {
		    if (end < start) {
			    return null;
		    }
		    int mid = (start + end) / 2;
		    TreeNode n = new TreeNode(arr[mid]);
		    n.SetLeftChild(CreateMinimalBst(arr, start, mid - 1));
		    n.SetRightChild(CreateMinimalBst(arr, mid + 1, end));
		    return n;
	    }