144.二叉树的前序遍历 js实现

var preorderTraversal = function(root) {
	const res = [];
	const stack = [];
	if(root) stack.push(root);
	while(stack.length) {
		const n = stack.pop()
		res.push(n.val)
		if(n.right) stack.push(n.right)
		if(n.left) stack.push(n.left)
}

你可能感兴趣的:(算法,二叉树,leetcode,栈,javascript)