forked from striver79/FreeKaTreeSeries
-
Notifications
You must be signed in to change notification settings - Fork 0
/
inorderJava
30 lines (29 loc) · 840 Bytes
/
inorderJava
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// LC: https://leetcode.com/problems/binary-tree-inorder-traversal
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private void dfs(TreeNode node, List<Integer> inorder) {
if(node == null) return;
dfs(node.left, inorder);
inorder.add(node.val);
dfs(node.right, inorder);
}
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> inorder = new ArrayList<Integer>();
dfs(root, inorder);
return inorder;
}
}