public TreeNode invertTree(TreeNode root) {
if (root == null) return null;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.addFirst(root);
TreeNode t = null;
while (!queue.isEmpty()){
TreeNode node = queue.poll();
t = node.left;
node.left = node.right;
node.right = t;
if (node.left != null) queue.addFirst(node.left);
if (node.right != null) queue.addFirst(node.right);
}
return root;
}
leetcode 226 翻转二叉树
最新推荐文章于 2024-04-20 15:52:31 发布