mirror of
https://github.com/TheAlgorithms/Ruby
synced 2024-12-27 21:58:57 +01:00
23 lines
No EOL
451 B
Ruby
23 lines
No EOL
451 B
Ruby
# Definition for a binary tree node.
|
|
# class TreeNode
|
|
# attr_accessor :val, :left, :right
|
|
# def initialize(val)
|
|
# @val = val
|
|
# @left, @right = nil, nil
|
|
# end
|
|
# end
|
|
|
|
# @param {TreeNode} root
|
|
# @return {Integer[]}
|
|
def preorder_traversal(root)
|
|
ans = []
|
|
def traverse(node, ans)
|
|
if node != nil
|
|
ans.push(node.val)
|
|
traverse(node.left, ans)
|
|
traverse(node.right, ans)
|
|
end
|
|
end
|
|
traverse(root, ans)
|
|
return ans
|
|
end |