I\'m making a binary tree and this is my insert function; it works perfectly:
if(newData < data){ if(left) left->insert(newData); else left = ne