-
-
Notifications
You must be signed in to change notification settings - Fork 46.8k
Added/transform bst sum tree in data structures #9772
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Added/transform bst sum tree in data structures #9772
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper
commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper review
to trigger the checks for only added pull request files@algorithms-keeper review-all
to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
|
||
""" | ||
|
||
def __init__(self, x) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide descriptive name for the parameter: x
Please provide type hint for the parameter: x
# This function traverses the tree in reverse inorder so | ||
# that we have visited all greater key nodes of the currently | ||
# visited node | ||
def transformTreeUtil(root) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Variable and function names should follow the snake_case
naming convention. Please update the following name accordingly: transformTreeUtil
Please provide type hint for the parameter: root
transformTreeUtil(root.left) | ||
|
||
# A wrapper over transformTreeUtil() | ||
def transformTree(root) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Variable and function names should follow the snake_case
naming convention. Please update the following name accordingly: transformTree
Please provide type hint for the parameter: root
|
||
# A utility function to prindorder traversal of a | ||
# binary tree | ||
def printInorder(root): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: printInorder
. If the function does not return a value, please provide the type hint as: def function() -> None:
Variable and function names should follow the snake_case
naming convention. Please update the following name accordingly: printInorder
Please provide type hint for the parameter: root
for more information, see https://pre-commit.ci
Describe your change:
In the data structures section in binary trees added an algorithm to convert a binary search tree to a greater sum tree
Checklist: