（144,145,94）leetcode题树的遍历（递归法）——java

最新推荐文章于 2024-06-12 10:00:23 发布

GO!!!

最新推荐文章于 2024-06-12 10:00:23 发布

阅读量61

点赞数 1

分类专栏： leetcode 文章标签： leetcode java 算法

本文链接：https://blog.csdn.net/m0_51799816/article/details/125094664

版权

leetcode 专栏收录该内容

54 篇文章 1 订阅

订阅专栏

树的前序遍历：

/**
 * 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 List<Integer> preorderTraversal(TreeNode root) {
            List<Integer> result=new ArrayList<Integer>();
            preorder(root,result);
            return result;
    }

    public void  preorder(TreeNode root,List<Integer> result)
    {
        if(root==null)
        {
            return;
        }
        result.add(root.val);
        preorder(root.left,result);
        preorder(root.right,result);
    } 
}

树的中序遍历：

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

树的后序遍历：

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