How to solve Binary Search Tree problems on my computer?

Hello

I am need help with the following problem that I have:

I would like to try to solve the binary search tree problem on my local computer. So I copy the starting from leetcode in my IDE. Example:

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {TreeNode}
 */
var invertTree = function(root) {
    
};

I obviously need some more code than the example posted here to be able to console.log my results on my local computer. Where I can find this code? Can anyone post link or code snippet? I am facing same issue with Linked lists questions, so I guess solving this issue willl help me to solve that one too.

Any help will be deeply appreciated.

Cheers , Z

Comments (2)