Leetcode-94 Binary Tree Inorder Traversal Solution in Java | Hindi Coding Community

 Given the root of a binary tree, you have return the inorder traversal of its nodes values. Do the inrorder traversal.

 

Example 1:

Input: root = [1,null,2,3]
Output: [1,3,2]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

 

Constraints:

• The number of nodes in the tree is in the range [0, 100].
• -100 <= Node.val <= 100

Java Code :

class Solution {

public List<Integer> inorderTraversal(TreeNode root) {

List<Integer> al= new ArrayList<Integer>();

Stack<TreeNode> st=new Stack<TreeNode>();

TreeNode curr=root;

while(curr!=null || (!st.isEmpty()))

{

while(curr!=null)

{

st.push(curr);

curr=curr.left;

}

curr=st.pop();

al.add(curr.val);

curr=curr.right;

}

return al;

}

}

If you want to write for us please contact us at hindicodingcommunity@gmail.com