leetcode94

class Solution {
public:
    vector<int> V;
    void inOrder(TreeNode* node)
    {
        if (node != NULL)
        {
            if (node->left != NULL)
            {
                inOrder(node->left);
            }

            V.push_back(node->val);

            if (node->right != NULL)
            {
                inOrder(node->right);
            }
        }
    }
    vector<int> inorderTraversal(TreeNode* root) {
        inOrder(root);
        return V;
    }
};

二叉树的中序遍历。

补充python版本实现：

class Solution:
    def __init__(self):
        self.lists = []
        
    def inOrder(self,root):
        if root != None:
            if root.left != None:
                self.inorderTraversal(root.left)
            self.lists.append(root.val)
            if root.right != None:
                self.inorderTraversal(root.right)
        
        
    def inorderTraversal(self, root: 'TreeNode') -> 'List[int]':
        self.inOrder(root)
        return self.lists