二叉树的深度优先遍历和广度优先遍历

function DFS(root){
var stack = [];
stack.push(root);
var node = null;
while(stack.length){
node = stack.pop();
//visit node.data;
if(node.right){
stack.push(node.right);
}
if(node.left){
stack.push(node.left);
}
}
}

function BFS(root){
var queue = [];
queue.push(root);
var node = null;
while(queue.length){
node = queue.shift();
//visit node.data
if(node.left){
queue.push(node.left);
}
if(node.right){
queue.push(node.right);
}
}
}