Purpose:the ADT myBinarySearchTrees<T1, T2> has been extended with 3 new operations:
17. public int my_count_at_level(int level);
This operation receives as an input the level of the tree we are looking for, and returns the amount of nodes placed on that level.
18. public boolean my_is_balanced();
A binary tree is balanced when the length of its two subtrees (left subtree and right subtree) do not differ in more than 1 unit, and the proper left subtree and right subtree are balanced trees as well).
This operation returns if the tree is balanced or not.
19. public int my_count_smaller_nodes(T1 key);
This operation receives as an input a key, and returns the amount of nodes in the tree with smaller key values.
20. public int my_find_node_at_level(T1 key);
This operation receives as an input a key, and returns the level were the node is located.
Implement the 4 methods in the class [login to view URL] using recursion. Note: You can reuse any of the other 16 defined operations if you want
Hey!
I would like to help you. I am an experienced Java programmer and I have strong background in helping students with their tasks.
The code will be written cleanly, fully commented and I offer also full explaination after giving it to you.
Hello Sir/Ma’am
NovaSofts Inc. is the leading IT Company of Islamabad Pakistan. A team of competent Engineers having 5+ years of experience and strong knowledge about programming languages
Java
C++
C
C#
python
Android
We are a team of Software Engineers so you don’t need to worry about third party client. We are very much experienced and assure you that we’ll provide quality work. The project bid is negotiable and P.M for sample work. Thanks