958. Check Completeness of a Binary Tree
发布时间:2020-12-14 05:08:17 所属栏目:大数据 来源:网络整理
导读:958 . Check Completeness of a Binary Tree // https://leetcode.com/problems/check-completeness-of-a-binary-tree/description/ class TreeNode(var `val`: Int) { var left: TreeNode ? = null var right: TreeNode ? = null } class Solution { fun is
958. Check Completeness of a Binary Tree //https://leetcode.com/problems/check-completeness-of-a-binary-tree/description/ class TreeNode(var `val`: Int) { var left: TreeNode? = null var right: TreeNode? = null } class Solution { fun isCompleteTree(root: TreeNode?): Boolean { if (root == null) { return false } val linkedList = LinkedList<TreeNode>() linkedList.add(root) while (linkedList.peek()!=null) { //if popped node is not null,then add its left and right child,no matter if they are null or not val cur = linkedList.poll() linkedList.offer(cur.left) linkedList.offer(cur.right) } //get right node first while (linkedList.isNotEmpty() && linkedList.peek()==null){ linkedList.poll() } return linkedList.isEmpty() } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |