HR30 Day 23: BST Level-Order Traversal 문서 원본 보기

==개요==
HR30 Day 23: BST Level-Order Traversal
*https://www.hackerrank.com/challenges/30-binary-trees/problem

{{HR30 헤더}}
{{HR30 20-29}}
|}

==Java==
{{참고|HR30 Day 23: BST Level-Order Traversal/Java}}
<syntaxhighlight lang='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);
        }
    }
</syntaxhighlight>

==PHP==
{{참고|HR30 Day 23: BST Level-Order Traversal/PHP}}
<syntaxhighlight lang='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;             }
    }
</syntaxhighlight>