update status (convert_binary_search_tree_to_sorted_doubly_linked_list.py)

Author: yennanliu

README.md

@@ -707,7 +707,7 @@
 530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)| [python](https://github.com/yennanliu/CS_basics/blob/master/leetcode_python/Binary_Search_Tree/minimum-absolute-difference-in-bst.py)  | _O(n)_ | _O(h)_ | Easy | | AGAIN*
 776|[Split BST](https://leetcode.com/problems/split-bst/)| [python](https://github.com/yennanliu/CS_basics/blob/master/leetcode_python/Binary_Search_Tree/split-bst.py) | _O(n)_ | _O(h)_ | Medium | 🔒 | AGAIN (not start*)
 783|[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)| [python](https://github.com/yennanliu/CS_basics/blob/master/leetcode_python/Binary_Search_Tree/minimum-distance-between-bst-nodes.py) | _O(n)_ | _O(h)_ | Easy | | OK* 
-426|[Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/)| [Python](https://github.com/yennanliu/CS_basics/blob/master/leetcode_python/Binary_Search_Tree/convert_binary_search_tree_to_sorted_doubly_linked_list.py) ||| Medium |`UBER`, `lyft`, `amazon`, `google`,`fb`| AGAIN****  (not start) (3)
+426|[Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/)| [Python](https://github.com/yennanliu/CS_basics/blob/master/leetcode_python/Binary_Search_Tree/convert_binary_search_tree_to_sorted_doubly_linked_list.py) ||| Medium |`UBER`, `lyft`, `amazon`, `google`,`fb`| AGAIN****  (not start) (4)
 
 
 ## Breadth-First Search 

doc/leetcode_company_V2.md

@@ -848,7 +848,7 @@
 | 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | 42.4% | 0.092 | OK**** (4)
 | 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | Medium | 35.6% | 0.412 | AGAIN** (4) (not start)
 | 733 | [Flood Fill](https://leetcode.com/problems/flood-fill/) | Easy | 48.0% | 0.027 | OK**** (4)
-| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | Medium | 37.2% | 0.748 | AGAIN****  (not start) (3)
+| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | Medium | 37.2% | 0.748 | AGAIN****  (not start) (4)
 | 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | Medium | 33.5% | 0.048 |  AGAIN******* (3)
 | 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | Medium | 38.8% | 0.031 | AGAIN***** (3)
 | 772 | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii/) | Hard | 41.6% | 0.17 |