Exemple #1
0
        public int FindSecondLargest(BinaryTreeNode10 rootNode)
        {
            if (rootNode == null ||
                rootNode.Left == null && rootNode.Right == null)
            {
                throw new ArgumentException("Tree must have at least 2 nodes", nameof(rootNode));
            }

            var current = rootNode;

            while (true)
            {
                if (current.Left != null && current.Right == null)
                {
                    return(FindLargest(current.Right));
                }

                if (current.Right != null &&
                    current.Right.Left == null &&
                    current.Right.Right == null)
                {
                    return(current.Value);
                }

                current = current.Right;
            }
            ;
        }
Exemple #2
0
        public int FindLargest(BinaryTreeNode10 rootNode)
        {
            var current = rootNode;

            while (current.Right != null)
            {
                current = current.Right;
            }
            return(current.Value);
        }
Exemple #3
0
 public BinaryTreeNode10 InsertLeft(int leftValue)
 {
     Left = new BinaryTreeNode10(leftValue);
     return(Left);
 }
Exemple #4
0
 public BinaryTreeNode10 InsertRight(int rightValue)
 {
     Right = new BinaryTreeNode10(rightValue);
     return(Right);
 }
Exemple #5
0
        public static void Main(string[] args)
        {
            // QUESTION 1
            var stockPrices = new int[] { 12, 10, 7, 5, 11, 9, 2 };

            Console.WriteLine(Question1.GetMaxProfit(stockPrices));

            // QUESTION 2
            var intArray = new int[] { 3, 4 };
            var result2  = Question2.GetProductsOfAllIntsExceptAtIndex(intArray);

            foreach (var value in result2)
            {
                Console.Write($"{value} ");
            }
            Console.WriteLine();

            // QUESTION 4
            var meetings = new List <Meeting>()
            {
                new Meeting(0, 12),
                new Meeting(1, 2),
                new Meeting(22, 23)
            };

            var result4 = Question4.mergeRanges(meetings);

            foreach (var meeting in result4)
            {
                Console.Write($"{meeting} ");
            }
            Console.WriteLine();


            // QUESTION 5
            Console.WriteLine(Question5.ChangePossibilitiesBottomUp(4, new int[] { 1, 2, 3 }));

            // QUESTION 6
            Console.WriteLine(Question6.FindRectangularOverlap(new Rectangle(1, 10, 3, 20), new Rectangle(2, 10, 3, 15)).LeftX);

            // QUESTION 7
            TempTracker temp = new TempTracker();

            temp.addTemperature(1);
            temp.addTemperature(3);
            temp.addTemperature(6);
            temp.addTemperature(3);
            temp.addTemperature(1);
            temp.addTemperature(3);
            Console.WriteLine($"Max: {temp.GetMax()}");
            Console.WriteLine($"Min: {temp.GetMin()}");
            Console.WriteLine($"Average: {temp.GetMean()}");
            Console.WriteLine($"Total: {temp.GetMode()}");

            // QUESTION 8
            BinaryTreeNode1 tree  = new BinaryTreeNode1(1);
            BinaryTreeNode1 left1 = tree.InsertLeft(2);
            BinaryTreeNode1 left2 = left1.InsertLeft(3);
            BinaryTreeNode1 left3 = left2.InsertLeft(4);

            BinaryTreeNode1 right1      = tree.InsertRight(5);
            BinaryTreeNode1 right1left1 = tree.InsertRight(8);
            BinaryTreeNode1 right2      = right1.InsertRight(6);
            BinaryTreeNode1 right3      = right2.InsertRight(7);

            Console.WriteLine("Is balanced:D " + Question8.IsBalanced(tree));

            BinaryTreeNode1 tree2    = new BinaryTreeNode1(1);
            BinaryTreeNode1 left2_1  = tree2.InsertLeft(2);
            BinaryTreeNode1 right2_1 = tree2.InsertRight(5);

            Console.WriteLine("Is balanced:D " + Question8.IsBalanced(tree2));

            // QUESTION 10
            Console.WriteLine("Question 10");
            BinaryTreeNode10 tree10  = new BinaryTreeNode10(2);
            BinaryTreeNode10 left101 = tree10.InsertLeft(1);

            BinaryTreeNode10 right101 = tree10.InsertRight(3);

            Question10 q10 = new Question10();

            Console.WriteLine(q10.FindSecondLargest(tree10));

            // QUESTION 12
            Console.WriteLine("Question 12");
            Question12 q12 = new Question12();

            q12.BinarySeach(12, new int[] { 1, 3, 5, 6, 8, 12, 13 });

            // QUESTION 13
            Console.WriteLine("Question 13");
            Question13 q13 = new Question13();

            Console.WriteLine(q13.FindIndexOfRotation(new string[] {
                "ptolemaic",
                "retrograde",
                "supplant",
                "undulate",
                "xenoepist",
                "asymptote",  // <-- rotates here!
                "babka",
                "banoffee",
                "engender",
                "karpatka",
                "othellolagkage",
            }));
        }