C# - BFS | Backwards | Beats 90%
Intuition\nProcessing a tree in BFS is usually done left to right; however, if we reverse that, then the last node we process will hold the answer. \n\n# Comple
# Intuition\nProcessing a tree in BFS is usually done left to right; however, if we reverse that, then the last node we process will hold the answer. \n\n# Complexity\n- Time: $$O(n)$$\n- Space: $$O(1)$$\n\n# Code\n```\npublic class Solution {\n    public int FindBottomLeftValue(TreeNode root) {\n        \n\t\tvar bfs = new Queue<TreeNode>();\n\t\tbfs.Enqueue(root);\n\n\t\twhile (bfs.Count > 0)\n\t\t{\n            root = bfs.Dequeue();\n\n            if (root.right != null) bfs.Enqueue(root.right);\n            if (root.left != null) bfs.Enqueue(root.left);\n\t\t}\n        \n\t\treturn root.val;\n    }\n}\n```
['Tree', 'Breadth-First Search', 'Queue', 'C#']