Skip to content

Conversation

yolophg
Copy link
Contributor

@yolophg yolophg commented Jun 12, 2024

  • Reorder List
  • Remove Nth Node From End of List
  • Lowest Common Ancestor of a Binary Search Tree
  • Binary Tree Level Order Traversal
  • Validate Binary Search Tree

@yolophg yolophg marked this pull request as draft June 12, 2024 10:16
@yolophg yolophg marked this pull request as ready for review June 15, 2024 05:48
@yolophg yolophg requested a review from Invidam June 15, 2024 05:48
Copy link
Contributor

@Invidam Invidam left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

7주차도 수고하셨습니다!! 👍


// initialize a queue for BFS.
let queue = [];
queue.push({ node: root, min: -Infinity, max: Infinity });
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

JS는 Infinity 라는 게 있군요. 신기하네요!


while (queue.length > 0) {
// dequeue the front one.
let { node, min, max } = queue.shift();
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

간결하고 좋네요! 👍

@yolophg yolophg merged commit 528e73a into DaleStudy:main Jun 17, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
No open projects
Status: Done
Development

Successfully merging this pull request may close these issues.

2 participants