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.

Sign up for GitHub

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

Jump to bottom

Learn Tree, BST #19

Open

8 of 9 tasks

yukisato opened this issue Jan 12, 2020 · 1 comment

Labels

Study

Owner

yukisato commented Jan 12, 2020 •

edited

Loading

Maximum Depth of Binary Tree (Easy) - 3+3 min
Minimum Depth of Binary Tree (Easy) - 0 min(already solved and understandable)
Merge Two Binary Trees (Easy) - 5+10min
Convert Sorted Array to Binary Search Tree (Easy)
Path Sum (Easy) -
Binary Tree Level Order Traversal (Medium) - 3+7min
Binary Tree Zigzag Level Order Traversal (Medium) - 3+6min
Validate Binary Search Tree (Medium) - 57min MUST RETRY
Construct Binary Tree from Preorder and Inorder Traversal (Medium)

yukisato added the Study label

yukisato added the Important label

yukisato removed the Important label

Owner Author

yukisato commented Feb 15, 2020

Validate Binary Search Tree (Medium)
Must retry.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment