{"height":"190","type":"rich","blog_url":"https://blog.pco2699.net/","author_name":"pco2699","description":"\u554f\u984c May Leetcoding Challange Complement\u306e21\u65e5\u76ee\u3067\u3059\u3002 5\u6708\u3082\u4e0b\u65ec\u3002\u65e9\u3044\u3002 leetcode.com BST\u306e\u30c8\u30e9\u30d0\u30fc\u30b9\u3059\u308b\u554f\u984c\u3067\u3059\u3002 \u89e3\u304d\u65b9 \u89e3\u304d\u65b9\u306f\u6975\u3081\u3066\u30b7\u30f3\u30d7\u30eb\u3067\u3001BST\u3092DFS - Inorder\u3067\u306a\u3081\u3066\u3044\u304d\u3001Array\u306b\u8a70\u3081\u3066\u30a2\u30af\u30bb\u30b9\u3059\u308c\u3070OK\u3002 \u6728\u306eInorder\u3001Preorder\u3001Postorder\u306b\u3064\u3044\u3066\u306f\u3053\u306e\u8a18\u4e8b\u304c\u308f\u304b\u308a\u3084\u3059\u3044\u3002 www.geeksforgeeks.org \u56de\u7b54 class Solution: def kthSmallest(self, root: TreeNode, k: int) -> int: res = [] de\u2026","image_url":"https://cdn.blog.st-hatena.com/images/theme/og-image-1500.png","blog_title":"pco2699\u2019s blog","title":" LeetCode: Kth Smallest Element in a BST\u3092\u89e3\u304f","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.pco2699.net%2Fentry%2F2020%2F05%2F20%2F230239\" title=\" LeetCode: Kth Smallest Element in a BST\u3092\u89e3\u304f - pco2699\u2019s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://blog.pco2699.net/entry/2020/05/20/230239","version":"1.0","width":"100%","author_url":"https://blog.hatena.ne.jp/pco2699/","provider_url":"https://hatena.blog","categories":["LeetCode"],"provider_name":"Hatena Blog","published":"2020-05-20 23:02:39"}