Dev06 6 tree node day4 assignment ricardo collado#21
Open
RicardoColladoRothschild wants to merge 2 commits intoorodriguez:mainfrom
Open
Conversation
…tant time, due to be using a field that increase one, every time a new child is added (it increase base on father)
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Solution:
Original Version of the Level() fucntion was on big o O(n).
We remove the while bucle, and use a constat time O(1), by having a field that every time a new TreeNode is created, it takes
parent Level() information (if not null) and inrease by 1. If not Parent exist, it start the root TreeNode with Level = 0