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.73K
1 Posted Topic
I did something similar but easier to understand void binary_half(int low, int high) { int mid = (low + high) / 2; root = insert_bst(id_table[mid], root); //recursive - id, root address if (mid != low) binary_half(low, mid); if (mid != high) binary_half(mid+1, high); }
The End.