Binary Tree, Recursion, DFS Practice (FREE)😱

Are you ready to implement all the theory lessons you have learned on Binary Trees and the types of traversal into solving real practical problem scenarios?

💻
Are you all set with your preparation for using the knowledge of DFS algorithms in solving coding problems in competitive programming challenges?

If you have a sliver of a doubt, take a moment and take advantage of the practice questions that we have curated for you with inputs from industry experts who know what expectations companies have from potential candidates. Solve them all and solve them right. Practise, practise & practise till you are able to solve any problem related to Binary Trees, their DFS traversal or Recursion efficiently & effectively.

As part of Skillenza initiative SkillDojo, your one-stop solution for learning, upskilling and advancing towards your dream career, we have an excellent practice test for you to take your skillset up a notch.👩‍💻

Take advantage of these practice tests designed especially for you to help you crack any coding interview.

There are 2 stages of practice tests, 1 quiz and 1 competitive programming test.
Just click on the Register button and start your test.
Once you’ve finished with your self-assessment, you will be able to see your score.

If you are looking for more

If you are looking for a carefully designed curriculum with live sessions with expert mentors, and guaranteed placement with annual severance package ranging from ₹ 5 Lakhs to 30 Lakhs, and a minimum guarantee salary of ₹ 5 LPA
Join SkillDojo Pro, a 4+2 month intensive programming Bootcamp.👇

A bit more about competitive programming (CP)

What is competitive programming?

It’s a programming challenge with test cases and constraints. The programs are command-line ones.
The test case is a set of two files viz. Input and output. The input is directed into the program through STDIN and the output from the program is compared with the expected output. We additionally support reading from an extracted zipped folder also.

What is the scoring scheme for competitive programming?

The dashboard provides two modes viz. test and submit. Test runs your code against sample/public test cases. Submit runs against hidden/private ones. Only sample test cases and their elaborate run results are made available. We also show a line by line comparison with the expected output. For the hidden/private test cases, only we only show the exit code, passed status, time consumption, memory consumption and score. We expect users to take cues from these values.

Both the public and private test cases use the same parameters/constants (check below for information on the parameters). It’s just that using the test button will award a 0 score for the leader-board irrespective of whether or not the code passed the public test cases. It’s for debugging only.

The score is entirely dependant on the output values from the test run viz. execution time, memory consumed and program size in characters. Time elapsed since the start of the test is not a parameter as of now but we might introduce it in the future. The code judging system lets the setter set weight-ages (non-negative weight-ages to the three parameters). If the metric is only performance, a setter can set a positive weight for time and have the memory and size as zero.

The formula for a single test case given correct output is

memory_weight*(1 - memory/memory_max) + time_weight*(1 - time/time_max) + size_weight*(1 - size/size_max)

This is summed across all the test cases (each test case also has a positive weight-age) and finally normalised to 100.

Is it possible to get 100% in any test case?

Yes. If it’s a time-weighted one, because of the precision of the system, one can complete execution in 0s.