Create AVL Tree #552
Closed
Create AVL Tree #552
+288
−0
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Codecov Report
@@ Coverage Diff @@
## master #552 +/- ##
=========================================
Coverage 100.00% 100.00%
=========================================
Files 150 150
Lines 2627 2627
Branches 439 439
=========================================
Hits 2627 2627 Continue to review full report at Codecov.
|
leandrocodes
suggested changes
Oct 1, 2020
Comment on lines
+1
to
+288
| printf("\n The value to be deleted is not present in the tree"); | ||
| return(tree); | ||
| } | ||
| if(cur–>left == NULL) | ||
| ptr = cur–>right; | ||
| else if(cur–>right == NULL) | ||
| ptr = cur–>left; | ||
| else | ||
| { | ||
| // Find the in–order successor and its parent | ||
| psuc = cur; | ||
| cur = cur–>left; | ||
| while(suc–>left!=NULL) | ||
| { | ||
| psuc = suc; | ||
| suc = suc–>left; | ||
| } | ||
| if(cur==psuc) | ||
| { // Situation 1 | ||
| suc–>left = cur–>right; | ||
| } | ||
| else | ||
| { // Situation 2 | ||
| suc–>left = cur–>left; | ||
| psuc–>left = suc–>right; | ||
| suc–>right = cur–>right; | ||
| } | ||
| ptr = suc; | ||
| } | ||
| // Attach ptr to the parent node | ||
| if(parent–>left == cur) | ||
| parent–>left=ptr; | ||
| else | ||
| parent–>right=ptr; | ||
| free(cur); | ||
| return tree; | ||
| } | ||
|
|
||
| int totalNodes(struct node *tree) | ||
| { | ||
| if(tree==NULL) | ||
| return 0; | ||
| else | ||
| return(totalNodes(tree–>left) + totalNodes(tree–>right) + 1); | ||
| } | ||
| int totalExternalNodes(struct node *tree) | ||
| { | ||
| if(tree==NULL) | ||
| return 0; | ||
| else if((tree–>left==NULL) && (tree–>right==NULL)) | ||
| return 1; | ||
| else | ||
| return (totalExternalNodes(tree–>left) + totalExternalNodes(tree–>right)); | ||
| } | ||
|
|
||
| int totalInternalNodes(struct node *tree) | ||
| { | ||
| if( (tree==NULL) || ((tree–>left==NULL) && (tree–>right==NULL))) | ||
| return 0; | ||
| else | ||
| return (totalInternalNodes(tree–>left) + totalInternalNodes(tree–>right) + 1); | ||
| } | ||
|
|
||
| int Height(struct node *tree) | ||
| { | ||
| int leftheight, rightheight; | ||
| if(tree==NULL) | ||
| return 0; | ||
| else | ||
| { | ||
| leftheight = Height(tree–>left); | ||
| rightheight = Height(tree–>right); | ||
| if(leftheight > rightheight) | ||
| return (leftheight + 1); | ||
| else | ||
| return (rightheight + 1); | ||
| } | ||
| } | ||
| struct node *mirrorImage(struct node *tree) | ||
| { | ||
| struct node *ptr; | ||
| if(tree!=NULL) | ||
| { | ||
| mirrorImage(tree–>left); | ||
| mirrorImage(tree–>right); | ||
| ptr=tree–>left; | ||
| ptr–>left = ptr–>right; | ||
| tree–>right = ptr; | ||
| } | ||
| } | ||
|
|
||
| struct node *deleteTree(struct node *tree) | ||
| { | ||
| if(tree!=NULL) | ||
| { | ||
| deleteTree(tree–>left); | ||
| deleteTree(tree–>right); | ||
| free(tree); | ||
| } | ||
| } |
There was a problem hiding this comment.
Isn't that supposed to be a Javascript source code?
|
The files must be in JS format. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.