Inorder Traversal Of A Binary Tree In Java
Inorder traversal visits left node then root and finally right node. Solution uses recursive approach to traverse binary tree in order, adding values to a list as it goes.
Problem
In inorder traversal of a binary tree, we visit left node then root and finally the right node.
/**
* 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 {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
inor...