본문 바로가기
Programming/Data Structure

[Hackerrank] TreePostorderTraversal

by 읽고 쓰는 개발자 2020. 12. 2.

www.hackerrank.com/challenges/tree-postorder-traversal/problem

 

Tree: Postorder Traversal | HackerRank

Print the post order traversal of a binary tree.

www.hackerrank.com

package exam.complete;
//https://www.hackerrank.com/challenges/tree-postorder-traversal/problem

import exam.Node;

public class TreePostorderTraversal {
    public static void main(String[] args) {
        Node node4 = new Node(4);
        Node node3 = new Node(3, null, node4);
        Node node6 = new Node(6);
        Node node5 = new Node(5, node3, node6);
        Node node2 = new Node(2, null, node5);
        Node node1 = new Node(1, null, node2);
        postOrder(node1);
    }
    public static void postOrder(Node root) {
        if(root.left != null) postOrder(root.left);
        if(root.right != null) postOrder(root.right);
        System.out.print(root.val+" ");
    }
}

'Programming > Data Structure' 카테고리의 다른 글

[Hackerrank] BinarySearchTreeInsertion  (0) 2020.12.06
[Hackerrank] TreePreorderTraversal  (0) 2020.12.02
[Hackerrank] TreeInorderTraversal  (0) 2020.12.02
[Hackerrank] TreeHeightofaBinaryTree  (0) 2020.12.02
[Hackerrank] SortedInsert  (0) 2020.12.02