Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit44cfdc6

Browse files
authored
Merge pull requestneetcode-gh#1313 from voski/patch-14
Create 102-Binary-Tree-Level-Order-Traversal.rb
2 parentsc447042 +f0aea65 commit44cfdc6

File tree

1 file changed

+32
-0
lines changed

1 file changed

+32
-0
lines changed
Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
# Definition for a binary tree node.
2+
# class TreeNode
3+
# attr_accessor :val, :left, :right
4+
# def initialize(val = 0, left = nil, right = nil)
5+
# @val = val
6+
# @left = left
7+
# @right = right
8+
# end
9+
# end
10+
# @param {TreeNode} root
11+
# @return {Integer[][]}
12+
deflevel_order(root)
13+
result=[]
14+
15+
level=[]
16+
level <<rootifroot
17+
untillevel.empty?
18+
vals=[]
19+
next_level=[]
20+
21+
level.eachdo |node|
22+
vals <<node.val
23+
next_level <<node.leftifnode.left
24+
next_level <<node.rightifnode.right
25+
end
26+
27+
result <<vals
28+
level=next_level
29+
end
30+
31+
result
32+
end

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp