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.68K
~361 People Reached
Favorite Forums
Favorite Tags
1 Posted Topic
Re: AVL Tree
Here is a link which does as you were asking, it detects duplicates when inserting and before balancing. http://www.refcode.net/2013/02/balanced-avl-binary-search-trees.html, hopefully this helps. Here is the insert routine: //Insert i into the tree t, duplicate will be discarded //Return a pointer to the resulting tree. Tree * insert(int value, Tree * …
The End.