Write a Python program to find the kth smallest element in a given a binary search tree.
class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = None def kth_smallest(root, k): stack =  while root or stack: while root: stack.append(root) root = root.left root = stack.pop() k -= 1 if k == 0: break root = root.right return root.val root = TreeNode(8) root.left = TreeNode(5) root.right = TreeNode(14) root.left.left = TreeNode(4) root.left.right = TreeNode(6) root.left.right.left = TreeNode(8) root.left.right.right = TreeNode(7) root.right.right = TreeNode(24) root.right.right.left = TreeNode(22) print(kth_smallest(root, 2)) print(kth_smallest(root, 3))
Write a Python program to find the kth smallest element in a given a binary search tree
Disclaimer: The information and code presented within this recipe/tutorial is only for educational and coaching purposes for beginners and developers. Anyone can practice and apply the recipe/tutorial presented here, but the reader is taking full responsibility for his/her actions. The author (content curator) of this recipe (code / program) has made every effort to ensure the accuracy of the information was correct at time of publication. The author (content curator) does not assume and hereby disclaims any liability to any party for any loss, damage, or disruption caused by errors or omissions, whether such errors or omissions result from accident, negligence, or any other cause. The information presented here could also be found in public knowledge domains.