Skip to content

Conversation

@RicardoColladoRothschild

Completed:

  • Implemented Set data structure: Use BStree as base data structure to hold data when saved into a Set.

  • Print(): TreeNode => We use the help of the method TraversePreOrder, to go thorught the tree, we evaluate current depth and depending on depth we follow instructions from the homework adding characters. Then we take the value of the currentTree, and put it on the result we got so far (TraversePreOrder use recursion which means that it will end after the last leaf)

orodriguez and others added 6 commits February 14, 2024 15:25
…ePreOrder, to go thorught the tree, we evaluate current depth and depending on depth we follow instructions from the homework adding characters. Then we take the value of the currentTree, and put it on the result we got so far (TraversePreOrder use recursion which means that it will end after the last leaf)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants