Binary tree from a list

[dan789]

It´s against project rules. I have to create other method, which counts nodes, but just from the node given as it´s parameter. Therefore I need to find the reference for this node for that parameter, from "nodes".

[ichabod801]

If the node is given as a parameter, why do you need to find the node? I would think that given a node, you would just recursively count the children of the node.

[dan789]

It should be non-recursive. And the parameter is just a value of that node (sorry for wrong information in my post above).

[ichabod801]

I have a feeling that you are not expected to have a root dictionary, although you could pass it as a parameter to the method. Again, it would help to see your code of the classes, and it would be good to see the actual assignment.

[dan789]

Simply, this new method should count nodes in a selected subtree, specified by a given node data. This node represents a root of that subtree, whose nodes it has to count. So what do I want to do, is to find that node data in already created "nodes" (dictionary), to find its Node refference and then apply the basic nodes counting, beginning with this node. However, I have "nodes" in other method and so what I need to know is, how can I use "nodes" also in this new method, without making an attribute for the whole class.