LeetCode.104. Maximum Depth of Binary Tree

public class Solution {
    private void TraverseNode(TreeNode node)
        {
            if (node == null)
            {
                return;
            }
            if (node.val > max_depth)
            {
                max_depth = node.val;
            }
            if (node.left != null)
            {
                node.left.val = node.val+1;
                TraverseNode(node.left);
            }
            if (node.right != null)
            {
                node.right.val = node.val + 1;
                TraverseNode(node.right);
            }
        }
        private int max_depth = 0;
        public int MaxDepth(TreeNode root)
        {
            
            if (root == null)
            {
                return 0;
            }
            else
            {
                root.val = 1;
                TraverseNode(root);
                return max_depth;
            }
            
        }
}