Add Code of Deletion and Sorting of Nodes in Binary Tree#369
Add Code of Deletion and Sorting of Nodes in Binary Tree#369GarvTambi wants to merge 21 commits intoTheAlgorithms:masterfrom
Conversation
Added RC4 stream cipher algorithm
Add Splay Tree in DS
7.c :reverse of a number with overflow check added
The correct format specifier for `size_t` is `%zu`. If C89 support is needed, `%lu` along with a cast to `unsigned long` will suffice. Also added error checking for calloc.
Cleaned up the code and used meaningful variable names
Fixed a critical flaw where `strcpy` would write the final NUL-terminator in an invalid location invoking Undefined Behavior. Allocated one extra byte to fix it. Cleaned up the code as well in the process
Improved code Asthetics
Cleaned up, meaningful variable names
Update BubbleSort.c
+1 byte for the NUL-terminator
Format specifier for size_t, calloc check
|
@GarvTambi thank you for contributing, but we already have an implementation of binary search tree (with node deletion). So please remove Deletion of node in Binary Tree from the PR. It would be great if you could add some functionality to the already existing program. There seems to be some problem, previously accepted commits appear in your commits section too. So i would suggest you to close this PR, & please create a new PR with the Binary tree sort.c file. |
|
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
|
Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions! |
8 participants
No description provided.