We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d7833b8 commit e77c0d3Copy full SHA for e77c0d3
leetcode.com 230. Kth Smallest Element in a BST v2/main.py
@@ -0,0 +1,25 @@
1
+from typing import Optional, List
2
+
3
4
+# Definition for a binary tree node.
5
+class TreeNode:
6
+ def __init__(self, val=0, left=None, right=None):
7
+ self.val = val
8
+ self.left = left
9
+ self.right = right
10
11
12
+class Solution:
13
+ def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
14
+ dt = []
15
+ self.inorder(root, dt)
16
+ return dt[k - 1]
17
18
+ def inorder(self, node: Optional[TreeNode], dt: List[int]):
19
+ if node.left:
20
+ self.inorder(node.left, dt)
21
22
+ dt.append(node.val)
23
24
+ if node.right:
25
+ self.inorder(node.right, dt)
0 commit comments