DAY23——二叉树part9

1.修建二叉搜索树

 

class Solution {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        if (root == null) {
            return null;
        }
        if (root.val < low) {
            //递归右子树，并返回右子树符合条件的头结点
            return trimBST(root.right, low, high); 
        }
        if (root.val > high) {
            //递归左子树，并返回左子树符合条件的头结点
            return trimBST(root.left, low, high);   
        }
        // root在[low,high]范围内
        root.left = trimBST(root.left, low, high); // root->left接入符合条件的左孩子
        root.right = trimBST(root.right, low, high);// root->right接入符合条件的右孩子
        return root;
    }
}

2.

 类似二分法递归

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
		TreeNode root = traversal(nums, 0, nums.length - 1);
		return root;
	}

	// 左闭右闭区间[left, right]
	private TreeNode traversal(int[] nums, int left, int right) {
		if (left > right) return null;

		int mid = left + ((right - left) >> 1); //防止溢出
		TreeNode root = new TreeNode(nums[mid]);
		root.left = traversal(nums, left, mid - 1);
		root.right = traversal(nums, mid + 1, right);
		return root;
	}
}

3.二叉树变为累加树

 代码随想录 (programmercarl.com)

class Solution {
    int sum;
    public TreeNode convertBST(TreeNode root) {
        sum = 0;
        convertBST1(root);
        return root;
    }

    // 按右中左顺序遍历后累加
    public void convertBST1(TreeNode root) {
        if (root == null) {
            return;
        }
        convertBST1(root.right);
        sum += root.val;
        root.val = sum;
        convertBST1(root.left);
    }
}