We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
199. 二叉树的右视图
/** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } */ /** * @param {TreeNode} root * @return {number[]} */ var rightSideView = function(root) { if(!root) return []; const queue = [root], nodes = []; while(queue.length > 0) { let len = queue.length; nodes.push(queue[len-1].val); for(let i=0; i<len; i++) { queue[i].left && queue.push(queue[i].left); queue[i].right && queue.push(queue[i].right); } queue.splice(0, len); } return nodes; };
The text was updated successfully, but these errors were encountered:
No branches or pull requests
199. 二叉树的右视图
The text was updated successfully, but these errors were encountered: