| 5 | |
| 6 | // Definition for a binary tree node. |
| 7 | class TreeNode { |
| 8 | int val; |
| 9 | TreeNode left; |
| 10 | TreeNode right; |
| 11 | |
| 12 | TreeNode(int x) { |
| 13 | val = x; |
| 14 | } |
| 15 | } |
| 16 | |
| 17 | public class LevelOrderTraversal { |
| 18 | public void levelOrder(TreeNode root) { |
nothing calls this directly
no outgoing calls
no test coverage detected