문제링크 : www.hackerrank.com/challenges/tree-inorder-traversal/problem
public static void inOrder(Node root) {
if(root==null) return;
inOrder(root.left);
System.out.print(root.data +" ");
inOrder(root.right);
}
'알고리즘 > 해커랭크' 카테고리의 다른 글
[해커랭크] Tree: Postorder Traversal [JAVA] (0) | 2021.01.18 |
---|---|
[해커랭크] Tree: Height of a Binary Tree [JAVA] (0) | 2021.01.18 |
[해커랭크] Tree: Preorder Traversal [JAVA] (0) | 2021.01.18 |
[해커랭크] Find Merge Point of Two Lists (0) | 2021.01.14 |
[해커랭크] Delete duplicate-value nodes from a sorted linked list (0) | 2021.01.14 |