Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //https://www.hackerrank.com/challenges/30-binary-trees/problem
- static void levelOrder(Node root){
- //Write your code here
- Queue<Node> q = new Queue<Node>();
- q.Enqueue(root);
- while(q.Count != 0){
- Node helper = q.Dequeue();
- Console.Write(helper.data + " ");
- if(helper.left != null){
- q.Enqueue(helper.left);
- }
- if(helper.right != null){
- q.Enqueue(helper.right);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement