Inorder Traversal

𝔸𝕝𝕘𝕖𝕣

Inorder Traversal

# 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 inorder_traversal(root)
  ans = []
  def traverse(node, ans)
    unless node.nil?
      traverse(node.left, ans)
      ans.push(node.val)
      traverse(node.right, ans)
    end
  end
  traverse(root, ans)
  ans
end

Try this Code

About us

We are a group of programmers helping each other build new things, whether it be writing complex encryption programs, or simple ciphers. Our goal is to work together to document and model beautiful, helpful and interesting algorithms using code. We are an open-source community - anyone can contribute. We check each other's work, communicate and collaborate to solve problems. We strive to be welcoming, respectful, yet make sure that our code follows the latest programming guidelines.