[LeetCode] 94. Binary Tree Inorder Traversal 二叉树的中序遍历
it iteratively? 二叉树的中序遍历顺序为左-根-右，可以有递归和非递归来解，其中非递归解法又 ...
原文：[LeetCode] 94. Binary Tree Inorder Traversal 二叉树的中序遍历
Given a binary tree, return theinordertraversal of its nodes values. For example:Given binary tree , , , , return , , . Note:Recursive solution is trivial, could you do it iteratively confused what , ...
2018-03-01 06:24 0 953 推荐指数：
相关推荐
[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal 由先序和中序遍历建立二叉树
Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree ...
[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍历建立二叉树
. 这道题要求从中序和后序遍历的结果来重建原二叉树，我们知道中序的遍历顺序是左-根-右，后序的顺序是左-右- ...
[LeetCode] 102. Binary Tree Level Order Traversal 二叉树层序遍历
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary ...
[LeetCode] Binary Tree Level Order Traversal II 二叉树层序遍历之二
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root ...
[LeetCode] 144. Binary Tree Preorder Traversal 二叉树的先序遍历
Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do ...
LeetCode（94）：二叉树的中序遍历
Medium！ 题目描述： 给定一个二叉树，返回它的中序 遍历。 示例: 进阶: 递归算法很简单，你可以通过迭代算法完成吗？ 解题思路： 二叉树的中序遍历顺序为左-根-右，可以有递归和非递归来解，其中非递归解法又分为两种，一种是使用栈来解，另一种不需要使用栈。我们先来看递归方法 ...
[LeetCode] 971. Flip Binary Tree To Match Preorder Traversal 翻转二叉树以匹配先序遍历
Given a binary tree with N nodes, each node has a different value from {1, ..., N}. A node in this binary tree can be flipped by swapping the left ...