【java】DFS和BFS

【java】DFS和BFS

/**二叉树构造参考力扣
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
//DFS 递归实现
void dfs(TreeNode root){
    if(root==null){
        return;
    }
    dfs(root.left);
    dfs(root.right);
}
//BFS 队列实现
void bfs(TreeNode root){
    Queue<TreeNode>queue =new ArrayDeque<>();
    queue.add(root);
    while(!queue.isEmpty()){
        TreeNode node = queue.poll();
        if(node.left!=null){
            queue.add(node.left);
        }
        if(node.right!=null){
            queue.add(node.right);
        }
    }
}