0
Considering the tree below, I have a doubt.
A
B c
D E F G
H I J K
So, I wanted to know if there is or has been any way to make a SELECT, where I bring all the IDS that are left of A. Because getting left the right side follows the same logic.
The program registers people. Then the person A put 'B' and 'C' in his network. B left C right. Then B put D and E, and so on the tree. My question is, is how to make a Select where I search all the left side of the A.
Thank you for your attention, Eric Augusto.
Welcome to SOPT. Would you like [Edit] your post and add the code you are using, or what have you tried to do so far? So we can analyze and suggest a change. Thank you.
– David
See if this resolves: http://answall.com/q/2425/101
– Maniero
So I can post little, I still can’t think of anything to do anything, but I have the code where I get the information.]
– erictjs
Query got big mt and does not allow post, its I post piece by piece will confuse
– erictjs
@bigown none of the links help me. It’s not the msm thing I need.
– erictjs
So the question is not clear. If you improve it and demonstrate where is your real doubt can reopen.
– Maniero