LeetCode 数据结构基础 Day16 Java

199. 二叉树的右视图

问题描述:

 代码:

class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> list = new LinkedList<>();
        if(root==null)
            return list;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            int size=queue.size();
            for(int i=0;i<size;i++){
                TreeNode temp = queue.poll();
                if(i==size-1){
                    list.add(temp.val);
                }
                if(temp.left!=null)
                    queue.offer(temp.left);
                if(temp.right!=null)
                    queue.offer(temp.right);
            }
        }
        return list;
    }
}

思路:层序遍历 遍历前记录当前队列的size，当遍历到当前层的最后一个节点，就是所求值

113. 路径总和 II

问题描述:

代码:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    List<List<Integer>> ans = new LinkedList<>();
    Map<TreeNode,TreeNode> hx = new HashMap<TreeNode,TreeNode>();
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        if(root==null)
            return ans;
        Queue<TreeNode> queue = new LinkedList<>();
        Queue<Integer> sum = new LinkedList<>();
        queue.offer(root);
        sum.offer(0);
        while(!queue.isEmpty()){
            TreeNode temp = queue.poll();
            int curr = sum.poll()+temp.val;
           if(temp.left==null&&temp.right==null){
               if(targetSum==curr){
                   getPath(temp);
               }
           }else{
               if(temp.left!=null){
                   queue.offer(temp.left);
                   sum.offer(curr);
                   hx.put(temp.left,temp);
               }
               if(temp.right!=null){
                   queue.offer(temp.right);
                   sum.offer(curr);
                   hx.put(temp.right,temp);
               }
           }
        }
        return ans;
    }
    public void getPath(TreeNode root){
        List<Integer> temp=new LinkedList<>();
        while(root!=null){
            temp.add(root.val);
            root=hx.get(root);
        }
        Collections.reverse(temp);
        ans.add(new LinkedList<Integer>(temp));
    }
}

 思路:

 450. 删除二叉搜索树中的节点

问题描述:

 代码:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int successor(TreeNode root){
            root=root.right;
        while(root.left!=null){
            root=root.left;
        }
        return root.val;
    }
    public int precessor(TreeNode root){
            root=root.left;
        while(root.right!=null){
            root=root.right;
        }
        return root.val;
    }
    public TreeNode deleteNode(TreeNode root, int key) {
        if(root==null)return null;
        if(key>root.val){
            root.right=deleteNode(root.right,key);
        }else if(key<root.val){
            root.left=deleteNode(root.left,key);
        }else{
            if(root.right!=null){
                 root.val=successor(root);
                root.right=deleteNode(root.right,root.val);
            }else if(root.left!=null&&root.right==null){
                root.val=precessor(root);
                root.left=deleteNode(root.left,root.val);
            } else{
                root=null;
            }
        }
        return root;
    }
}

思路:

力扣https://leetcode-cn.com/problems/delete-node-in-a-bst/solution/shan-chu-er-cha-sou-suo-shu-zhong-de-jie-dian-by-l/