(LeetCode) 94. Binary Tree Inorder Traversal

문제 링크

• LeetCode

요약

• Inorder 구현문제

최종 §

결과

• Inorder tree traversal 을 구현하는 간단한 문제다.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *	 int val;
 *	 TreeNode *left;
 *	 TreeNode *right;
 *	 TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *	 TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *	 TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
	void traverse(TreeNode *cur, vector<int> &store) {
		if (cur) {
			if (cur->left) {
				traverse(cur->left, store);
			}
 
			store.push_back(cur->val);
 
			if (cur->right) {
				traverse(cur->right, store);
			}
		}
	}
public:
	vector<int> inorderTraversal(TreeNode* root) {
		vector<int> ret;
 
		traverse(root, ret);
 
		return ret;
	}
};