Subato 302/Javascript: Binärer Suchbaum

Resource Files

exercise672.zip
binTree.js
Solution Template

Javascript: Binärer Suchbaum

Schreiben Sie in Javascript für die Klasse BinTree, die Methoden:

size(): Zur Berechnung der Anzahl der Elemente in der Menge.
contains(el): Zum Testen, ob ein gesuchtes Element in der Menge enthalten ist.
add(e): Zum Einfügen eines weiteres Elements.
toArray(result): Die Elemente der Menge sollen in sortierter Reihenfolge dem Parameter zugefügt werden.

Fold all Unfold all Fullscreen Settings Help

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
class BinTree {
  constructor(left, element, right) {
    this.left = left;
    this.element = element;
    this.right = right;
    this.isEmpty = false;
  }
  static empty() {
    var result = new BinTree(null,0,null);
    result.isEmpty = true;
    return result;
  }
    
  add(el){
    //TODO
  }
  
  size(){
    //TODO
    return 0;
  }
  contains(el){
    //TODO
    return false;
  }
  toArray(result){
    //TODO
  }
}
module.exports = {BinTree}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

js
You are not logged in and therefore you cannot submit a solution.