(Solved) : Implement Countdown Tree File Countdowntreejava Balanced Search Tree Uses Partial Rebuildi Q28128110 . . . .

Implement a Countdown Tree, in the fileCountdownTree.java. This is a balanced search tree that usespartial rebuilding in a manner similar to scapegoat trees (seeOpenDataStructures.org: Scapegoat Trees).

Every countdown tree has a float parameter d, defined when it iscreated. We call this the tree’s countdown delayfactor.

Each node u in a countdown tree has an int countdown timer,u.timer. When a new node is created, it’s timer is set toMath.ceil(d).

When a node u’s timer reaches 0, the nodeexplodes, and the entire subtree rooted at u isrebuilt into a perfectly balanced binary search tree (note that uis probably not the root of this new subtree).