LeetCode #94 Binary Tree Inorder Traversal Solution & Explanation

public class Solution {
    
    public IList<int> InorderTraversal(TreeNode root) {
        List<int>res = new List<int>();
        if(root == null)
        {
            return res;
        } 
        return Inorder(res,root);
    }
    
    public IList<int> Inorder(IList<int> res,TreeNode root)
    {    
        if(root.left!=null)
        {
           res = Inorder(res,root.left); 
        }
        
        res.Add(root.val);
        
        if(root.right!=null)
        {
            res = Inorder(res,root.right); 
        }
        
        return res;
    }
}

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer>res = new ArrayList<Integer>();
        if(root == null)
        {
            return res;
        } 
        return Inorder(res,root);
    }
    
    public List<Integer> Inorder(List<Integer> res,TreeNode root)
    {    
        if(root.left!=null)
        {
           res = Inorder(res,root.left); 
        }
        
        res.add(root.val);
        
        if(root.right!=null)
        {
            res = Inorder(res,root.right); 
        }
        
        return res;
    }
}

class Solution:
    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
    
        def Inorder(root):
            if(root.left != None):
                Inorder(root.left)

            res.append(root.val)

            if(root.right != None):
                Inorder(root.right)
        
        res = []
        if(root == None):
            return res
        
        Inorder(root)
        return res

var inorderTraversal = function(root) {
    res = [];
    if(root == undefined)
    {
        return res;
    }
    return Inorder(res,root);
};

function Inorder(res,root)
{
    if(root.left!=undefined)
    {
       res = Inorder(res,root.left); 
    }

    res.push(root.val);

    if(root.right!=undefined)
    {
        res = Inorder(res,root.right); 
    }

    return res; 
}