엔지니어 게시판
LeetCode 솔루션 분류

[Easy - wk4 - Q1] 94. Binary Tree Inorder Traversal

작성자 정보

  • Chloe 작성
  • 작성일

컨텐츠 정보

본문

94. Binary Tree Inorder Traversal 


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

 

Example 1:

Input: root = [1,null,2,3]
Output: [1,3,2]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

 

Constraints:

  • The number of nodes in the tree is in the range [0, 100].
  • -100 <= Node.val <= 100

 

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

관련자료

댓글 1

mingki님의 댓글

  • mingki
  • 작성일
C++
Runtime: 3 ms, faster than 56.18% of C++ online submissions for Binary Tree Inorder Traversal.
Memory Usage: 10.3 MB, less than 7.18% of C++ online submissions for Binary Tree Inorder Traversal.
class Solution {
    vector<int> v;
    
public:
    vector<int> inorderTraversal(TreeNode* root) {
        if (root) {
            inorderTraversal(root->left);
            v.push_back(root->val);
            inorderTraversal(root->right);
        }
        return v;
    }
};
전체 128 / 1 페이지
게시글 쓰기
번호
제목
이름

최근글


새댓글


Stats


알림 0