Write a Python program to create a Balanced Binary Search Tree (BST) using an array (given) elements where array elements are sorted in ascending order.
class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = None def sorted_array_to_bst(nums): if not nums: return None mid_val = len(nums)//2 node = TreeNode(nums[mid_val]) node.left = sorted_array_to_bst(nums[:mid_val]) node.right = sorted_array_to_bst(nums[mid_val+1:]) return node def preOrder(node): if not node: return print(node.val) preOrder(node.left) preOrder(node.right) result = sorted_array_to_bst([1, 2, 3, 4, 5, 6, 7]) preOrder(result)
4 2 1 3 6 5 7
Write a Python program to create a Balanced Binary Search Tree (BST) using an array (given) elements where array elements are sorted in ascending order
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.