开源软件名称：

开源软件地址：

开源编程语言：

开源软件介绍：

Sprint Challenge: Data Structures and Algorithms

For this sprint challenge, you'll be implementing a few functions that build off of some of the data structures you implemented in the first half of the week. Then you'll be analyzing the runtimes of all of the data structure methods.

For the algorithms portion of the sprint challenge, you'll be answering the questions posed in the exercises.pdf file regarding runtime complexities and algorithmic paradigms.

Data Structures

Before getting started, run npm install in the root-level directory to install needed dependencies for testing.

Task 1. Implement Heapsort

Inside the src directory you'll also find the heap.js file with the completed code the heap class. Your second task is to implement a sorting method called heapsort that uses the heap data structure in order to sort an array of numbers. Your heapsort function should return a new array containing all of the sorted data.

Run npm test heap to run the tests for your heapsort function to ensure that your implementation is correct.

Task 2. Analyze some runtimes

Open up the Data_Structures_Answers.md file. This is where you'll jot down your answers for the runtimes of the two functions you just implemented, as well as the methods you implemented for all of the data structures. Be sure to also answer any other questions posed in the Answers.md file!

Stretch Task. Check if a binary search tree is balanced

Navigate into the data_structures directory. Inside the src directory, you'll see the binary-search-tree.js file with the completed code for the binary search tree class. Your first task is to write a separate function (not part of the BinarySearchTree class) that receives the root node of an instance of a binary search tree and returns true if the binary search tree is perfectly balanced, i.e., all the leaf nodes of the tree reside on the same level. Your function should return false if the tree is not perfectly balanced.

Run npm test binary-search-tree to run the tests for this function to ensure that your implementation is correct.

Algorithms

For the algorithms portion of the sprint challenge, you'll be answering questions posed in the exercises.pdf document inside the algorithms directory. Add your answers to the questions in the Algorithms_Answers.md file.