LeetCode-104.Maximum Depth of Binary Tree

1154 단어 LeetCodetree
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
귀속:
public int MaxDepth(TreeNode root) 
    {
        return root==null? 0 : Math.Max(MaxDepth(root.left), MaxDepth(root.right))+1;
    }

비귀속:
비귀속적인 사고방식은 사실상'층층이 내려가는 통계이다. 어떤 노드가 잎 노드를 포함하지 않을 때까지.
public int MaxDepth(TreeNode root) 
    {
        if (root == null)
                return 0;
            int count = 0,len;
            Queue<TreeNode> stack = new Queue<TreeNode>();
            stack.Enqueue(root);
            TreeNode node;
            while ((len=stack.Count)>0)
            {
                count++;
                for (int i = 0; i < len; i++)
                {
                    node = stack.Dequeue();
                    if (node.left != null)
                        stack.Enqueue(node.left);
                    if (node.right != null)
                        stack.Enqueue(node.right);
                }
            }
            return count;
    }

좋은 웹페이지 즐겨찾기