Write a Python program to convert a given array elements to a height balanced Binary Search Tree (BST).
Note: Search for a node to remove. If the node is found, delete the node.
class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = None def array_to_bst(array_nums): if not array_nums: return None mid_num = len(array_nums)//2 node = TreeNode(array_nums[mid_num]) node.left = array_to_bst(array_nums[:mid_num]) node.right = array_to_bst(array_nums[mid_num+1:]) return node def preOrder(node): if not node: return print(node.val) preOrder(node.left) preOrder(node.right) array_nums = [1,2,3,4,5,6,7] print("Original array:") print(array_nums) result = array_to_bst(array_nums) print("nArray to a height balanced BST:") print(preOrder(result))
Original array: [1, 2, 3, 4, 5, 6, 7] Array to a height balanced BST: 4 2 1 3 6 5 7 None
Write a Python program to convert a given array elements to a height balanced 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.