}returnisBalanced(root.left) && isBalanced(root.right); }privateintheight(TreeNode root){if(root ==null)return0;returnMath.max(height(root.left), height(root.right)) +1; } } the first time i wrote this code, if(Math.abs(height(root.left) - height(root.right)) <=1) {returntrue;...
https://github.com/grandyang/leetcode/issues/958 参考资料: https://leetcode.com/problems/check-completeness-of-a-binary-tree/ https://leetcode.com/problems/check-completeness-of-a-binary-tree/discuss/205682/JavaC%2B%2BPython-BFS-Level-Order-Traversal https://leetcode.com/problems/check-complet...
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode ...
/*** Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * }*/classSolution {publicbooleanisCompleteTree(TreeNode root) {if(root ==null)returntrue; Queue<TreeNode>queue =newLinkedList<>();...
To solve the problem, I made a little flashcards site where I could add flashcards of 2 types: general and code. Each card has different formatting. I made a mobile-first website so I could review on my phone and tablet, wherever I am. Make your own for free: Flashcards site repo...
TreeNode * node = que.front(); que.pop();if(!node) {break; }else{ que.push(node->left); que.push(node->right); } }while(!que.empty()) { TreeNode * node=que.front();if(node)returnfalse; que.pop(); }returntrue; }
1classSolution2{3public:4boolisCompleteTree(TreeNode*root)5{6if(root ==NULL)7returnfalse;89queue<TreeNode *>q;10q.push(root);11boolmustHaveNoChild =false;12boolresult =true;13while(!q.empty())14{15TreeNode* pNode =q.front();16q.pop();17if(mustHaveNoChild)//如果一个节点没有子...
/*** Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * }*/classSolution {publicbooleanisCompleteTree(TreeNode root) {if(root ==null)returntrue; ...