zoukankan      html  css  js  c++  java
  • 1.二叉树的中序遍历

    题目:给出一棵二叉树,返回其中序遍历

    /**

     * Definition of TreeNode:
     * class TreeNode {
     * public:
     *     int val;
     *     TreeNode *left, *right;
     *     TreeNode(int val) {
     *         this->val = val;
     *         this->left = this->right = NULL;
     *     }
     * }
     */
    class Solution {
        /**
         * @param root: The root of binary tree.
         * @return: Inorder in vector which contains node values.
         */
    public:
        vector<int> inorderTraversal(TreeNode *root) {
            // write your code here
            vector<TreeNode *> t;
            vector<int> res;
    while(root != NULL || t.size() != 0) {
    while(root != NULL) {
                    t.push_back(root);
                    root = root->left;
                }
                root = t.back();
                t.pop_back();
                res.push_back(root->val);
                root = root->right;
            }
            return res;
        }
    };

  • 相关阅读:
    webgl变换:深入图形平移
    webgl基础:顶点到片元的联动
    webgl基础:绘制多边形
    webgl初章:进入3D世界
    canvas动画实战与性能优化
    初识canvas(二)
    初识canvas(一)
    SQL换行符
    正则表达式校验
    2019.7.2 JQ
  • 原文地址:https://www.cnblogs.com/ALIMAI2002/p/7206740.html
Copyright © 2011-2022 走看看