I have implemented a binary tree (using a vector), and each time i get a new item to add to the tree, i count how many times its compared with someone bigger than itself (+1) and for each one it is NOT bigger than itself, it counts how many are at his right side.
Its kinda confusing
I belive the answer is to implement this kind of tree, I just cant get it right... any suggestions?
Code: Select all
HUMMM...