Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #107.55K
1 Posted Topic
 | Your preorder and inorder functions written above are same..! there should be some change in inorder.. it should be: void BinarySearchTree::inOrder(int currentIndex){ if(array[currentIndex] != NULL) { parent(currentIndex); cout << array[currentIndex] << endl; inOrder(2 * currentIndex + 1); inOrder(2 * currentIndex + 2); } } am I right??  |
The End.