문제링크 : www.hackerrank.com/challenges/tree-postorder-traversal/problem
public static void postOrder(Node root) {
if(root==null) return;
postOrder(root.left);
postOrder(root.right);
System.out.print(root.data + " ");
}
'알고리즘 > 해커랭크' 카테고리의 다른 글
[해커랭크] Binary Search Tree : Insertion [JAVA] (0) | 2021.01.18 |
---|---|
[해커랭크] Tree: Level Order Traversal [JAVA] (0) | 2021.01.18 |
[해커랭크] Tree: Height of a Binary Tree [JAVA] (0) | 2021.01.18 |
[해커랭크] Tree: Inorder Traversal [JAVA] (0) | 2021.01.18 |
[해커랭크] Tree: Preorder Traversal [JAVA] (0) | 2021.01.18 |