Binary Trees, Recursion and Tail Call Optimization in Javascript
Explore recursive and iterative techniques to determine the height of a binary tree in JavaScript. Learn to write pure functional solutions and optimize recursion with tail calls to improve code efficiency. This lesson prepares you for advanced ES6 job interview questions by enhancing problem-solving and algorithmic skills.
We'll cover the following...
We are covering each aspect of the job interviewing process. You have already seen some theoretical questions that demonstrate how well you can use JavaScript. You have seen some coding challenges that not only let you showcase your problem-solving abilities, but also demonstrate your theoretical knowledge and your algorithmic skills.
You are yet to experience some longer homework assignment type of tasks that challenge your abilities to write maintainable software. Some of these challenges are timed, some require you to use some frameworks or libraries, while others need you to structure your code.
The challenge I have chosen for this session is an online coding challenge on a site called HackerRank.
I have already recommended that you go through the challenges of a similar site called Codility. HackerRank ups the ante a bit more ...