15,907,687 members
See more:
Considering the order property of binary search trees I need to return an element given the 'x' place. The function is named 'FindXelement(natural x, binary b)' returning a node in such position 'x'. (must be done recursively) Ive got some aux functions such as Height_of_Tree, Min, Max and others but wasnt able to do that function. any idea?
Thanks

What I have tried:

using aux functions and recursion
Posted
Updated 19-Apr-17 9:32am

## Solution 1

Here you find a nice tutorial for binary tree.

Your return value can be as pointer.

## Solution 2

We do not do your HomeWork.
HomeWork is not set to test your skills at begging other people to do your work, it is set to make you think and to help your teacher to check your understanding of the courses you have taken and also the problems you have at applying them.
So, give it a try, reread your lessons and start working. If you are stuck on a specific problem, show your code and explain this exact problem, we might help.

As programmer, your job is to create algorithms that solve specific problems and you can't rely on someone else to eternally do it for you, so there is a time where you will have to learn how to. And the sooner, the better.
When you just ask for the solution, it is like trying to learn to drive a car by having someone else training.
Creating an algorithm is basically finding the maths and make necessary adaptation to fit your actual problem.

The idea of "development" is as the word suggests: "The systematic use of scientific and technical knowledge to meet specific objectives or requirements." BusinessDictionary.com[^]
That's not the same thing as "have a quick google and give up if I can't find exactly the right code".