[][src]Module leetcode_for_rust::cd0094_binary_tree_inorder_traversal

Binary Tree Inorder Traversalleetcode: binary_tree_inorder_traversal

Given a binary tree, return the inorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

Follow up: Recursive solution is trivial, could you do it iteratively?

Structs

TreeNode

Functions

inorder_traversal

Solutions