LeetCode #145 Binary Tree Postorder Traversal Solution & Explanation

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

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

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

            if(root.right != None):
                Postorder(root.right)
                
            res.append(root.val)
            
        
        res = []
        if(root == None):
            return res
        
        Postorder(root)
        return res 

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

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

    if(root.right!=undefined)
    {
        res = Postorder(res,root.right); 
    }
    
    res.push(root.val);
    
    return res; 
}