Business
Jobs
  • About Us
  • Solutions
    • Job Postings
      Post your job and receive qualified candidates in 48h.
    • Candidate Assessments
      500+ technical and psychological tests, plus anti-fraud.
    • Headhunting
      Tailor-made executive search from start to finish.
    • Payroll + EOR
      Payroll dispersal and EOR across 15+ LATAM countries.
  • Pricing
  • Jobs

0

192
Views
Intentando trabajar y hacer un método 'balanceFactor' para un BST. ¿No puede averiguar cómo calcular el factor de equilibrio... pasando el argumento incorrecto?

¿Creo que estoy usando 'esto' incorrectamente? No estoy seguro de cómo proceder. Aquí están los métodos que estoy usando.

 function BinarySearchTree(value) { this.value = value; this.right = null; this.left = null; } BinarySearchTree.prototype.add = function(value) { node = this; if (value < this.value) { if (this.left) this.left.add(value); else this.left = new BinarySearchTree(value); } if (value > this.value) { if (this.right) this.right.add(value); else this.right = new BinarySearchTree(value); } } BinarySearchTree.prototype.leftHeight = function(root = this.value) { if (this.value == null) { return 0; } let queue = []; queue.push(this); let leftHeight = 0; while (1 == 1) { let nodeCount = queue.length; if (nodeCount == 0) { return leftHeight - 1; } leftHeight++; while (nodeCount > 0) { let newNode = queue.shift(); if (newNode.left != null) { queue.push(newNode.left); } nodeCount--; } } } BinarySearchTree.prototype.rightHeight = function(root = this.value) { if (this.value == null) { return 0; } let queue = []; queue.push(this); let rightHeight = 0; while (1 == 1) { let nodeCount = queue.length; if (nodeCount == 0) { return rightHeight - 1; } rightHeight++; while (nodeCount > 0) { let newNode = queue.shift(); if (newNode.right != null) { queue.push(newNode.right); } nodeCount--; } } } BinarySearchTree.prototype.balanceFactor = function(this) { console.log(this.leftHeight) return this.leftHeight - this.rightHeight; }

Y aquí está la entrada y las pruebas que estoy ejecutando...

 let binarySearchTree = new BinarySearchTree; binarySearchTree = new BinarySearchTree(5); binarySearchTree.left = new BinarySearchTree(2) binarySearchTree.right = new BinarySearchTree(3); binarySearchTree.right.right = new BinarySearchTree(1); console.log(binarySearchTree.rightHeight()); console.log(binarySearchTree.leftHeight()); console.log(binarySearchTree.balanceFactor())

Los últimos 3 registros de la consola generan 2, 1 y NaN. ¡Entonces mis métodos de altura izquierda y derecha funcionan correctamente! ¿Alguien puede decirme por qué mi método 'balanceFactor' no funciona?

¡Gracias y felices fiestas!

about 4 years ago · Santiago Trujillo
1 answers
Answer question

0

leftHeight y rightHeight son funciones, por lo que debe llamarlas así

 BinarySearchTree.prototype.balanceFactor = function () { console.log(this.leftHeight()) return this.leftHeight() - this.rightHeight(); }
about 4 years ago · Santiago Trujillo Report
Answer question
Find remote jobs

Discover the new way to find a job!

Top jobs
Top job categories
Business
Post vacancy Pricing Sales
Legal
Terms and conditions Privacy policy
© 2026 PeakU Inc. All Rights Reserved.
Andres GPT
Show me some job opportunities
There's an error!