94 - Binary Tree Inorder Traversal

最新推荐文章于 2020-12-09 20:34:08 发布

原创最新推荐文章于 2020-12-09 20:34:08 发布 · 448 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#BinaryTree #Traversal

LeetCode 专栏收录该内容

41 篇文章

订阅专栏

本文介绍了一种实现二叉树中序遍历的方法，采用递归方式完成节点值的收集。首先访问左子树，然后输出当前节点值，最后访问右子树。文章还解释了二叉树的序列化表示。

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

For example:
Given binary tree {1,#,2,3},

return [1,3,2].

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

Subscribe to see which companies asked this question

思路分析：

二叉树的中序遍历。

Classic tree operation, recursion is a straightforward idea to solve this problem.
Recursively do:
(1) Visit left child
(2) Output current node
(3) Visit right child
if current node is empty, return.

/*
*/

#include "stdafx.h"
#include <iostream>
#include <vector>

using namespace std;

struct TreeNode
{
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution_094_BinaryTreeInorderTraversal
{
public:
	void inOrder(TreeNode *root, vector<int> &res)
	{
		if (root != NULL)
		{
			inOrder(root->left, res);
			res.push_back(root->val);
			inOrder(root->right, res);
		}
		
	}

	vector<int> inorderTraversal(TreeNode* root) 
	{
		vector<int> res;

		inOrder(root, res);

		return res;
	}
};