Given a BST and its root, print all sequences of nodes which give rise to the same bst

Question

Given a BST, find all sequences of nodes starting from root that will essentially give the same binary search tree.

Given a bst, say

  3
 /  \\
1             


        

Answer 1

I have a much shorter solution. What do you think about it?

function printSequences(root){
    let combinations = [];

    function helper(node, comb, others){
        comb.push(node.values);

        if(node.left) others.push(node.left);
        if(node.right) others.push(node.right);

        if(others.length === 0){
            combinations.push(comb);
            return;
        }else{
            for(let i = 0; i