思路:
首先将二叉搜索树由中序遍历得到有序的节点序列。
然后创建一棵平衡二叉树。
code:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def balanceBST(self, root