1.树的子结构
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:1.找到与B树相等的A树的根结点
2.循环判断B树的每一个结点是否与A树的每一个结点相等。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public boolean HasSubtree(TreeNode root1,TreeNode root2) {
boolean result = false;
if(root1!=null&&root2!=null){
if(root1.val==root2.val){
result = dos(root1,root2);
}
if(!result){
result = HasSubtree(root1.left,root2);
}
if(!result){
result = HasSubtree(root1.right,root2);
}
}
return result;
}
public boolean dos(TreeNode node1,TreeNode node2){
if(node2==null){
return true;
}
if(node1==null){
return false;
}
if(node1.val != node2.val){
return false;
}
return dos(node1.left,node2.left) && dos(node1.right,node2.right);
}
}
2.二叉树的镜像
操作给定的二叉树,将其变换为源二叉树的镜像。
如
思路:找到根节点,交换其左右子树递归
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public void Mirror(TreeNode root) {
if(root==null){
return ;
}
if(root.left==null&&root.right==null){
return ;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
if(root.left!=null){
Mirror(root.left);
}
if(root.right!=null){
Mirror(root.right);
}
}
}
3.包含min函数的栈
import java.util.Stack;
public class Solution {
Stack<Integer> s = new Stack<Integer>();
Stack<Integer> s2 = new Stack<Integer>();
public void push(int node) {
s.push(node);
if(s2.empty()){
s2.push(node);
}else if(node<s2.peek()){
s2.push(node);
}
}
public void pop() {
if(s2.peek()==s.peek()){
s2.pop();
}
s.pop();
}
public int top() {
return (int)s.peek();
}
public int min() {
return s2.peek();
}
}