1 Day 1 Algorithms65 [2019.01.14] BST Level-Order Traversal Problem Objective Today, we're going further with Binary Search Trees. Check out the Tutorial tab for learning materials and an instructional video!Task A level-order traversal, also known as a breadth-first search, visits each level of a tree's nodes from left to right, top to bottom. You are given a pointer, , pointing to the root of a binary search tree. Complete the levelOrder function provi.. 2019. 1. 14. [2019.01.11] Binary Search Trees Problem Objective Today, we're working with Binary Search Trees (BSTs). Check out the Tutorial tab for learning materials and an instructional video!Task The height of a binary search tree is the number of edges between the tree's root and its furthest leaf. You are given a pointer, , pointing to the root of a binary search tree. Complete the getHeight function provided in your editor so that it.. 2019. 1. 11. [2019.01.10] Generics Problem Objective Today we're discussing Generics; be aware that not all languages support this construct, so fewer languages are enabled for this challenge. Check out the Tutorial tab for learning materials and an instructional video!Task Write a single generic function named printArray; this function must take an array of generic elements as a parameter (the exception to this is C++, which tak.. 2019. 1. 10. [2019.01.09] Sorting Problem Objective Today, we're discussing a simple sorting algorithm called Bubble Sort. Check out the Tutorial tab for learning materials and an instructional video!Consider the following version of Bubble Sort:for (int i = 0; i 2019. 1. 9. [2019.01.08] Interfaces Problem Objective Today, we're learning about Interfaces. Check out the Tutorial tab for learning materials and an instructional video!Task The AdvancedArithmetic interface and the method declaration for the abstract divisorSum(n) method are provided for you in the editor below.Complete the implementation of Calculator class, which implements the AdvancedArithmetic interface. The implementation .. 2019. 1. 8. [2019.01.07] Queues and Stacks Problem Welcome to Day 18! Today we're learning about Stacks and Queues. Check out the Tutorial tab for learning materials and an instructional video!A palindrome is a word, phrase, number, or other sequence of characters which reads the same backwards and forwards. Can you determine if a given string, , is a palindrome?To solve this challenge, we must first take each character in , enqueue it i.. 2019. 1. 7. [2019.01.04] More Exceptions Problem Objective Yesterday's challenge taught you to manage exceptional situations by using try and catch blocks. In today's challenge, you're going to practice throwing and propagating an exception. Check out the Tutorial tab for learning materials and an instructional video!Task Write a Calculator class with a single method: int power(int,int). The power method takes two integers, and , as pa.. 2019. 1. 4. [2019.01.03] Exceptions - String to Integer Problem Objective Today, we're getting started with Exceptions by learning how to parse an integer from a string and print a custom error message. Check out the Tutorial tab for learning materials and an instructional video!Task Read a string, , and print its integer value; if cannot be converted to an integer, print Bad String.Note: You must use the String-to-Integer and exception handling cons.. 2019. 1. 3. [2019.01.02] Linked List Problem Objective Today we're working with Linked Lists. Check out the Tutorial tab for learning materials and an instructional video!A Node class is provided for you in the editor. A Node object has an integer data field, , and a Node instance pointer, , pointing to another node (i.e.: the next node in a list).A Node insert function is also declared in your editor. It has two parameters: a poin.. 2019. 1. 2. 이전 1 2 3 4 5 6 7 8 다음
