HR30 Day 23: BST Level-Order Traversal

1 개요

HR30 Day 23: BST Level-Order Traversal

• https://www.hackerrank.com/challenges/30-binary-trees/problem

해커랭크 30 Days of Code

문제	풀이
20-29 Day e
HR30 Day 20: Sorting
HR30 Day 21: Generics
HR30 Day 22: Binary Search Trees
HR30 Day 23: BST Level-Order Traversal
HR30 Day 24: More Linked Lists
HR30 Day 25: Running Time and Complexity
HR30 Day 26: Nested Logic
HR30 Day 27: Testing
HR30 Day 28: RegEx, Patterns, and Intro to Databases
HR30 Day 29: Bitwise AND

2 Java

HR30 Day 23: BST Level-Order Traversal/Java 문서를 참고하십시오.

    static void levelOrder(Node root){
        //Write your code here
        Queue<Node> queue = new LinkedList<Node>();
        queue.add(root);
        while(queue.peek() != null) {
            Node node = queue.remove();
            System.out.format("%d ", node.data);
            if(node.left != null) queue.add(node.left);
            if(node.right != null) queue.add(node.right);
        }
    }

3 PHP

HR30 Day 23: BST Level-Order Traversal/PHP 문서를 참고하십시오.

	public function levelOrder($root){
        //Write your code here
        $q = [];
        $q[] = $root;
        while( count($q)>0 && !is_null($q[0]) ) {
            $node = array_shift($q);
            echo $node->data." ";
            if(!is_null($node->left)) $q[]=$node->left;
            if(!is_null($node->right)) $q[]=$node->right;             }
    }