algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-07-07 09:54:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix binary tree node.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-04-05 15:54:25 +03:00
parent d19149de8e
commit 30c080ba02
2 changed files with 9 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/data-structures/tree/BinaryTreeNode.js
View File

@ -26,6 +26,10 @@ export default class BinaryTreeNode {
return Math.max(this.leftHeight, this.rightHeight); return Math.max(this.leftHeight, this.rightHeight);
} }
get balanceFactor() {
return this.leftHeight - this.rightHeight;
}
setLeft(node) { setLeft(node) {
this.left = node; this.left = node;
this.left.parent = this; this.left.parent = this;

5
src/data-structures/tree/__test__/BinaryTreeNode.test.js
View File

@ -115,6 +115,7 @@ describe('BinaryTreeNode', () => {
const grandGrandLeft = new BinaryTreeNode(7); const grandGrandLeft = new BinaryTreeNode(7);
expect(root.height).toBe(0); expect(root.height).toBe(0);
expect(root.balanceFactor).toBe(0);
root root
.setLeft(left) .setLeft(left)
@ -122,6 +123,7 @@ describe('BinaryTreeNode', () => {
expect(root.height).toBe(1); expect(root.height).toBe(1);
expect(left.height).toBe(0); expect(left.height).toBe(0);
expect(root.balanceFactor).toBe(0);
left left
.setLeft(grandLeft) .setLeft(grandLeft)
@ -131,6 +133,7 @@ describe('BinaryTreeNode', () => {
expect(left.height).toBe(1); expect(left.height).toBe(1);
expect(grandLeft.height).toBe(0); expect(grandLeft.height).toBe(0);
expect(grandRight.height).toBe(0); expect(grandRight.height).toBe(0);
expect(root.balanceFactor).toBe(1);
grandLeft.setLeft(grandGrandLeft); grandLeft.setLeft(grandGrandLeft);
@ -139,6 +142,7 @@ describe('BinaryTreeNode', () => {
expect(grandLeft.height).toBe(1); expect(grandLeft.height).toBe(1);
expect(grandRight.height).toBe(0); expect(grandRight.height).toBe(0);
expect(grandGrandLeft.height).toBe(0); expect(grandGrandLeft.height).toBe(0);
expect(root.balanceFactor).toBe(2);
}); });
it('should calculate node height for right nodes as well', () => { it('should calculate node height for right nodes as well', () => {
@ -149,5 +153,6 @@ describe('BinaryTreeNode', () => {
expect(root.height).toBe(1); expect(root.height).toBe(1);
expect(right.height).toBe(0); expect(right.height).toBe(0);
expect(root.balanceFactor).toBe(-1);
}); });
}); });