leetcode:balanced Binary Tree

Requirements: Determine whether a tree is a balanced binary tree

if  is height-The IS as in1

The code is as follows:

1 structTreeNode {2     intVal;3TreeNode *Left ;4TreeNode *Right ;5TreeNode (intx): Val (x), left (null), right (null) {}6 };7 8 intMaxtreedepth (TreeNode *root)//seek the depth of the tree first9 {Ten     if(NULL = =root) One         return 0; A     intLval = Maxtreedepth (root->Left ); -     intRval = Maxtreedepth (root->Right ); -     return 1+ (Lval > Rval?)lval:rval); the } - BOOLisbalanced (TreeNode *root)//Judging by the depth of the tree, whether it's a balance tree. - { -     if(NULL = =root) +         return true; -     intdiff = maxtreedepth (root->left)-Maxtreedepth (root->Right ); +     if(diff <-1|| Diff >1) A         return false; at     returnisbalanced (Root->left) && isbalanced (root->Right ); -}

leetcode:balanced Binary Tree