LeetCode题解之Balanced Binary Tree

1、题目描述

2、问题分析

DFS。

3、代码

   bool isBalanced(TreeNode* root) {
         if (root == NULL)
             return true;

         return  abs(height(root->left) - height(root->right)) <=  && isBalanced(root->left) && isBalanced(root->right); 

     }

     int height(TreeNode *node)
     {
         if (node == NULL)
             return ;
         if (node->left == NULL && node->right == NULL)
             return ;

         return  + max(height(node->left), height(node->right));

     }