JZ27 二叉树的镜像 ⭐
交换节点的左右子树
public class Solution {
public TreeNode Mirror (TreeNode pRoot) {
if (pRoot == null) return null;
TreeNode temp = pRoot.left;
pRoot.left = pRoot.right;
pRoot.right = temp;
Mirror(pRoot.left);
Mirror(pRoot.right);
return pRoot;
}
}
JZ32 从上往下打印二叉树 ⭐
即层序遍历,之前写过一道之字形遍历,和那个原理一样
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
LinkedList<TreeNode> qu = new LinkedList<>();
if (root != null) {
qu.offer(root);
}
while (!qu.isEmpty()) {
for (int i = qu.size(); i > 0; i--) {
TreeNode t = qu.removeFirst(); //头出
list.add(t.val);
if (t.left != null) { //尾入
qu.addLast(t.left);
}
if (t.right != null) {
qu.addLast(t.right);
}
}
}
return list;
}
}
JZ33 二叉搜索树的后序遍历序列吗 ⭐ ⭐
思路:二叉搜索树中序是递增的,找到根节点(初始就是right),再找到第一个大于根节点的点mid,这个点为界[left,mid-1][mid,right-1]左右就是分为根的左右两半。再找子树是否合法,比如右子树序列不能出现小于根的值。
import java.util.*;
public class Solution {
public boolean VerifySquenceOfBST(int [] sequence) {
if (sequence.length == 0) return false;
return judge(sequence, 0, sequence.length - 1);
}
public boolean judge(int[] sequence, int left, int right) {
if (left >= right) return true;
int root = sequence[right]; //根节点为最后一个元素
int mid = left;
while (mid <= right && sequence[mid] < root) {
mid++;
}
//右子树合法性
for (int j = mid; j < right; j++) {
if (sequence[j] < root)
return false;
}
return judge(sequence, left, mid - 1) && judge(sequence, mid, right - 1);
}
}