day14打卡：二叉树

今天主要是二叉树的学习不难主要是要求对二叉树的存储方式要了解。

前序遍历

/**
 * 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<Integer> list=new ArrayList<>();
    // 	    public List<Integer> preorderTraversal(TreeNode root) {
	//     	if(root==null)
	//     		return list;
	//     	list.add(root.val);
	//     	TreeNode l=root.left;
	//     	TreeNode r=root.right;
	//     	preorderTraversal(l);
	//     	preorderTraversal(r);
	//     	return list;
	//     }
        public List<Integer> preorderTraversal(TreeNode root) {
            List<Integer> list=new ArrayList<>();
            if(root==null)
            return list;
            Stack<TreeNode> stack=new Stack<>();
	    	stack.add(root);
	    	while(!stack.isEmpty()) {
	    		TreeNode tree=stack.pop();
	    		list.add(tree.val);
	    		if(tree.right!=null)stack.add(tree.right);
                if(tree.left!=null)stack.add(tree.left);
	    	}
	    	return list;
        }
}

中序遍历

/**
 * 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<Integer> list=new ArrayList<>();
    public List<Integer> inorderTraversal(TreeNode root) {
        if(root==null)
	    	return list;	    	
	    	TreeNode l=root.left;
	    	TreeNode r=root.right;            
	    	inorderTraversal(l);
	    	list.add(root.val);
            inorderTraversal(r);
	    	return list;
    }
}

后序遍历

/**
 * 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<Integer> list=new ArrayList<>();
    public List<Integer> postorderTraversal(TreeNode root) {
        if(root==null)
	    		return list;
	    	
	    	TreeNode l=root.left;
	    	TreeNode r=root.right;
	    	postorderTraversal(l);
	    	postorderTraversal(r);list.add(root.val);
	    	return list;
    }
}

记录

第14天了势头不错继续保持，但是越学越发现了自己知识的欠缺啊，哎！