[LeetCode] 513. Find Bottom Left Tree Value
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] 513. Find Bottom Left Tree Value相关的知识,希望对你有一定的参考价值。
https://leetcode.com/problems/find-bottom-left-tree-value/
用 BFS,层次遍历
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public int findBottomLeftValue(TreeNode root) { if (root == null) { return -1; } Queue<TreeNode> queue = new LinkedList<>(); queue.offer(root); int size = 1; int i = 0; int result = root.val; while (!queue.isEmpty()) { TreeNode current = queue.poll(); if (i == 0) { result = current.val; } if (current.left != null) { queue.offer(current.left); } if (current.right != null) { queue.offer(current.right); } i++; if (i == size) { i = 0; size = queue.size(); } } return result; } }
以上是关于[LeetCode] 513. Find Bottom Left Tree Value的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode - 513. Find Bottom Left Tree Value
leetcode 513. Find Bottom Left Tree Value
[LeetCode]513 Find Bottom Left Tree Value(BFS)