docs: update SOLUTION_TREE.md

Author: yanglbme

README.md

@@ -1,5 +1,5 @@
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="./img/leetcode-github-yanglbme.png" alt="LeetCode-GitHub-Doocs"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="./img/doocs-leetcode.png" alt="LeetCode-GitHub-Doocs"></a>
 </p>
 
 <p align="center">
@@ -10,8 +10,8 @@
   <a href="https://github.com/doocs/leetcode/blob/master/LICENSE"><img src="https://badgen.net/badge/license/Attribution-ShareAlike%204.0%20International/green" alt="LICENSE"></a>
   <a href="http://makeapullrequest.com"><img src="https://badgen.net/badge/PRs/welcome/cyan" alt="PRs Welcome"></a>
   <a href="https://github.com/doocs/intro"><img src="https://badgen.net/badge/organization/join%20us/pink" alt="open-source-organization"></a>
-  <!-- <a href="#backers" alt="sponsors on Open Collective"><img src="https://opencollective.com/leetcode-280/backers/badge.svg" /></a> 
-  <a href="#sponsors" alt="Sponsors on Open Collective"><img src="https://opencollective.com/leetcode-280/sponsors/badge.svg" /></a> -->
+  <!-- <a href="#backers" alt="sponsors on Open Collective"><img src="https://opencollective.com/doocs-leetcode/backers/badge.svg" /></a> 
+  <a href="#sponsors" alt="Sponsors on Open Collective"><img src="https://opencollective.com/doocs-leetcode/sponsors/badge.svg" /></a> -->
 </p>
 
 ## Introduction
@@ -32,4 +32,4 @@ I'm looking for long-term contributors/partners to this repo! Send me [PRs](http
 ## Contributors
 This project exists thanks to all the people who contribute. 
 
-<a href="https://github.com/doocs/leetcode/graphs/contributors"><img src="https://opencollective.com/leetcode-280/contributors.svg?width=890&button=false" /></a>
+<a href="https://github.com/doocs/leetcode/graphs/contributors"><img src="https://opencollective.com/doocs-leetcode/contributors.svg?width=890&button=false" /></a>

SOLUTION_TREE.md

@@ -145,6 +145,7 @@
 │   ├── README.md
 │   ├── Solution.cpp
 │   ├── Solution.java
+│   ├── Solution.js
 │   └── Solution.py
 ├── 0028.Implement strStr()
 │   ├── README.md
@@ -179,6 +180,7 @@
 │   ├── README.md
 │   ├── Solution.cpp
 │   ├── Solution.java
+│   ├── Solution.js
 │   └── Solution.py
 ├── 0036.Valid Sudoku
 │   ├── Solution.java
@@ -260,7 +262,8 @@
 │   ├── Solution.cpp
 │   └── Solution.java
 ├── 0058.Length of Last Word
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0059.Spiral Matrix II
 │   ├── README.md
 │   ├── Solution.cpp
@@ -401,21 +404,25 @@
 │   └── Solution.java
 ├── 0098.Validate Binary Search Tree
 │   ├── Solution.cpp
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0099.Recover Binary Search Tree
 │   └── Solution.java
 ├── 0100.Same Tree
 │   └── Solution.java
 ├── 0101.Symmetric Tree
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0102.Binary Tree Level Order Traversal
 │   ├── README.md
 │   ├── Solution.java
+│   ├── Solution.js
 │   └── Solution.py
 ├── 0103.Binary Tree Zigzag Level Order Traversal
 │   └── Solution.java
 ├── 0104.Maximum Depth of Binary Tree
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0105.Construct Binary Tree from Preorder and Inorder Traversal
 │   ├── README.md
 │   ├── Solution.cpp
@@ -426,7 +433,8 @@
 ├── 0107.Binary Tree Level Order Traversal II
 │   └── Solution.java
 ├── 0108.Convert Sorted Array to Binary Search Tree
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0109.Convert Sorted List to Binary Search Tree
 │   └── Solution.java
 ├── 0110.Balanced Binary Tree
@@ -520,7 +528,8 @@
 │   ├── README.md
 │   ├── Solution.java
 │   ├── Solution.js
-│   └── Solution.py
+│   ├── Solution.py
+│   └── Solution2.js
 ├── 0142.Linked List Cycle II
 │   ├── README.md
 │   ├── Solution.cpp
@@ -565,7 +574,8 @@
 │   └── Solution.js
 ├── 0160.Intersection of Two Linked Lists
 │   ├── README.md
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0162.Find Peak Element
 │   └── Solution.java
 ├── 0164.Maximum Gap
@@ -660,7 +670,8 @@
 │   └── Solution.py
 ├── 0234.Palindrome Linked List
 │   ├── README.md
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.js
 ├── 0235.Lowest Common Ancestor of a Binary Search Tree
 │   ├── README.md
 │   └── Solution.java