Repository files navigation

A collection of JavaScript problems and solutions for studying algorithms.

• Binary Tree Inorder Traversal
• Unique Binary Search Trees
• Unique Binary Search Trees II
• Validate Binary Search Tree
• Recover Binary Search Tree
• Same Tree
• Symmetric Tree
• Binary Tree Level Order Traversal
• Binary Tree Zigzag Level Order Traversal
• Maximum Depth of Binary Tree
• Construct Binary Tree From Preorder and Inorder Traversal
• Construct Binary Tree From Postorder and Inorder Traversal
• Convert Sorted Array to Binary Search Tree
• Balanced Binary Tree
• Minimum Depth of Binary Tree
• Path Sum
• Path Sum II
• Flatten Binary Tree to Linked List
• Populating Next Right Pointers in Each Node
• Populating Next Right Pointers in Each Node II
• Binary Tree Maximum Path Sum
• Sum Root to Leaf Numbers
• Binary Tree Preorder Traversal
• Binary Tree Postorder Traversal
• Binary Tree Upside Down
• Univalue Tree
• Count Univalue Subtrees
• Lowest Common Ancestor of A Binary Search Tree

• Longest Increasing Subsequence

MIT License

Copyright (c) 2017 Yong Su @jeantimex

Permission is hereby granted, free of charge, to any person obtaining a copyof this software and associated documentation files (the "Software"), to dealin the Software without restriction, including without limitation the rightsto use, copy, modify, merge, publish, distribute, sublicense, and/or sellcopies of the Software, and to permit persons to whom the Software isfurnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in allcopies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS ORIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THEAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHERLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THESOFTWARE.