Binary Tree Paths: Accepted

Author: gouthampradhan

README.md

@@ -227,6 +227,7 @@ My accepted leetcode solutions to some of the common interview problems.
 - [Maximum Binary Tree](problems/src/tree/MaximumBinaryTree.java) (Medium)
 - [Find Bottom Left Tree Value](problems/src/tree/FindBottomLeftTreeValue.java) (Medium)
 - [Diameter of Binary Tree](problems/src/tree/DiameterOfBinaryTree.java) (Easy)
+- [Binary Tree Paths](problems/src/tree/BinaryTreePaths.java) (Easy)
 
 #### [Two Pointers](problems/src/two_pointers)
 

problems/src/tree/BinaryTreePaths.java

@@ -0,0 +1,47 @@
+package tree;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * Created by gouthamvidyapradhan on 09/12/2017.
+ * Given a binary tree, return all root-to-leaf paths.
+
+ For example, given the following binary tree:
+
+ 1
+ /   \
+ 2     3
+ \
+ 5
+ All root-to-leaf paths are:
+
+ ["1->2->5", "1->3"]
+ */
+public class BinaryTreePaths {
+
+    public class TreeNode {
+        int val;
+        TreeNode left;
+        TreeNode right;
+        TreeNode(int x) { val = x; }
+    }
+
+    public List<String> binaryTreePaths(TreeNode root) {
+        List<String> result = new ArrayList<>();
+        new BinaryTreePaths().inorder(root, result, "");
+        return result;
+    }
+
+    private void inorder(TreeNode node, List<String> list, String path){
+        if(node != null){
+            if(node.left == null && node.right == null){
+                list.add(path + node.val);
+            } else {
+                inorder(node.left, list, path + node.val + "->");
+                inorder(node.right, list, path + node.val + "->");
+            }
+        }
+    }
+
+}