is balanced tree

by Diana Lemen

JavaScript

const tree = {
	val: 4,
  left: {
  	val: 2,
    left: { val: 1 },
    right: { val: 3 }
  },
  right: {
  	val: 10,
  	left: {
    	val: 8,
      left: { val: 7 },
      right: { val: 9 }
    },
    right: { val: 11 }
  }
}

function traverce(node, res) {
	if(!node) {
  	return true
	}

  if(node.left && (node.val < node.left.val)) {
  	res.isValid = false;
  }
 
  if(node.right && (node.val > node.right.val)) {
  	res.isValid = false;
  }
  
  traverce(node.left, res);
  traverce(node.right, res);
}

function checkIfValid() {
	const res = { isValid: true };
  traverce(tree, res);
  return res.isValid;
}

console.log(checkIfValid());