Leetcode 104) Maximum Depth of Binary Tree

06 Jul 2021 in Algorithms

내 답안

/**
 * 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 maxDepth(TreeNode root) {
        if(root==null)return 0;
        Queue<TreeNode> q = new LinkedList<>();
        q.add(root);
        int l=0;
        while(!q.isEmpty()){
            int size=q.size();

            for(int i=0;i<size;i++){
                TreeNode tmp= q.poll();

                if(tmp.right!=null){
                    q.add(tmp.right);}

                if(tmp.left!=null){
                    q.add(tmp.left);}
            }
            l++;
        }
        return l;

    }
}

다른 답안

/**
 * 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 maxDepth(TreeNode root) {
        return recur(root);
    }
    public int recur(TreeNode root) {
        if (root == null) return 0;
        int depth1 = recur(root.left) + 1;
        int depth2 = recur(root.right) + 1;
        return Math.max(depth1, depth2);
    }
}