This project contains a skeleton for you to implement a binary tree. This is a test-driven project. Run the tests and read the top-most error. If it's not clear what is failing, open the test/test.js file to figure out what the test is expecting. Make the top-most test pass.
Keep making the top-most test pass until all tests pass.
The algorithms for the traversal functions are in the files and are reproduced here.
procedure in order array (node)
parameter node: a tree node
if the tree node is null, return an empty array
// get the array for visiting the left node of node
// get the array for visiting the right node of node
// return the left array concatenated with the node value
// concatenated with the right array
end procedure in order array
procedure post order array (node)
parameter node: a tree node
if the tree node is null, return an empty array
// get the array for visiting the left node of node
// get the array for visiting the right node of node
// return the left array concatenated with the right array
// concatenated with the node value
end procedure post order array
- Clone the project from https://github.com/appacademy-starters/data-structures-binary-tree-starter
cdinto the project foldernpm installto install dependencies in the project root directorynpm testto run the specs- You can view the test cases in
test/test.js. Your job is to write code in- problems/01-tree-node.js to implement the
TreeNodeclass - problems/02-tree-order.js to implement the
inOrderArrayandpostOrderArrayfunctions to traverse a tree - problems/03-dfs.js to implement a Depth First Search.
- problems/04-bfs.js to implement a Breadth First Search.
- BONUS: problems/05-leet-code-105.js as a scratch pad to work on the LeetCode.com problem at https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- problems/01-tree-node.js to implement the