lintcode
class BST { constructor() { this.root = null; } addNode(val) { function dfs(node) { if(node === null) { return new TreeNode(val); } if(val >= node.val) { node.right = dfs(node.right); } else { node.left = dfs(node.left); } return node; } this.root = dfs(this.root); }addNodes(arr) { let tree = this; arr.forEach(val => { tree.addNode(val); }) }}
3.5
2
let arr = [1, 2, 3, 4, 5];for(let i = 0; i < arr.length; i++){ console.log(arr[i]);}
Thank you!
2
3.5
(2 Votes)
0
4
5
function countNodes(root) { function dfs(node) { if(node === null) return 0; return dfs(node.left) + dfs(node.right) + 1; } dfs(root);}
Thank you!
5
4
(5 Votes)
0
4
3
function height(root) { function dfs(node) { if(node === null) return 0; return Math.max(dfs(node.left), dfs(node.right)) + 1; } dfs(root);}
Thank you!
3
4
(3 Votes)
0
Are there any code examples left?
New code examples in category Other
