Leetcode 110 - balanced tree - July 25, 2018 mock interview 10:00 PM - less than 15 minutes.

Leetcode110_balancedTree.cpp

#include <iostream>
using namespace std;

// To execute C++, please define "int main()"
int main() {
  // Construct tree
  TreeNode *root; // assign
  
  bool answer = true;
  IsHeightBalanced(root, answer); // no need catch
  cout << answer << endl;
  
  return 0;
}

int IsHeightBalanced(TreeNode *root, bool &answer)
{ 
  if (root)
  {
    int leftSubtreeHeight = IsHeightBalanced(root->left, answer);
    int rightSubtreeHeight = IsHeightBalanced(root->right, answer);
    if (abs(leftSubtreeHeight - rightSubtreeHeight) > 1)
    {
      answer = false;
    }
    return 1 + 
  }
  return 0;
}