<p>Implement a <strong>Countdown Tree</strong>, in the fileCountdownTree.java. This is a balanced search tree that usespartial rebuilding in a manner similar to scapegoat trees (seeOpenDataStructures.org: Scapegoat Trees).</p><p>Every countdown tree has a
<h3>Question Description</h3> <p>Write a program to do the following:</p><ol><li>Use the sample data file I provided for verifying the results of your BST homework (called bst_testfile.txt below) to enter data into
<p>1 Recursion Warm-up (matlab)</p><p>For this problem you are going to rewrite some simple iterativealgorithms as recur-</p><p>sive algorithms. The goal is to build your understanding of howrecursion works and</p><p>the importance of