【day14】二叉树前中后序遍历

1.前序遍历

给你二叉树的根节点 root ，返回它节点值的 前序 遍历。

输入：root = [1,null,2,3] 输出：[1,2,3]

递归三要素：
1.确定递归函数的参数和返回值；
2.确定递归的终止条件；
3.确定单层递归的逻辑；

递归法

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[]}
 */
var preorderTraversal = function(root) {
    let arr = [];
    treeNode(arr,root);
    return arr;
};

var treeNode = function(arr,root){
    if(root == null){
        return;
    }
    arr.push(root.val);
    treeNode(arr,root.left);
    treeNode(arr,root.right);
}

迭代法

var preorderTraversal = function(root) {
   
    let result = [];
    let stack = [];
    stack.push(root);
    while(stack.length > 0){
        let node = stack.pop();
        if(!node){
            continue;
        }
        result.push(node.val);
        stack.push(node.right);
        stack.push(node.left); 
    }
    return result;
};

2.中序遍历

输入：root = [1,null,2,3] 输出：[1,3,2]

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[]}
 */
var inorderTraversal = function(root) {
    let arr = [];
    treeNode(root,arr);
    return arr;
};
var treeNode = function(root,arr){
    if(root == null){
        return;
    }
    treeNode(root.left,arr);
    arr.push(root.val);
    treeNode(root.right,arr);
}

3.后序遍历

输入：root = [1,null,2,3]
输出：[3,2,1]

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[]}
 */
var postorderTraversal = function(root) {
    let arr = [];
    treeNode(root,arr);
    return arr;
};

var treeNode = function(root,arr){
    if(root == null){
        return;
    }
    treeNode(root.left,arr);
    treeNode(root.right,arr);
    arr.push(root.val);
}