MCPcopy Create free account
hub / github.com/betomoedano/JavaScript-Coding-Interview-Questions / BinaryTree

Class BinaryTree

binary-trees/Find-Successor.js:5–12  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

3// Time O(n) | Space O(n) where is the number of nodes
4
5class BinaryTree {
6 constructor(value) {
7 this.value = value;
8 this.parent = null;
9 this.right = null;
10 this.left = null;
11 }
12}
13
14
15const root = new BinaryTree(1);

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected