You are viewing a single comment's thread. Return to all comments →
You don't acrually have to create a separate node named Node. You can just say: root = new Node(); root.data = value; return root;
And it'll work just fine.
Seems like cookies are disabled on this browser, please enable them to open this website
Binary Search Tree : Insertion
You are viewing a single comment's thread. Return to all comments →
You don't acrually have to create a separate node named Node. You can just say: root = new Node(); root.data = value; return root;
And it'll work just fine.