Given a binary tree, return thepostordertraversal of its nodes values. For example:Given binary tree , , , , return , , . Note:Recursive solution is trivial, could you do it iteratively 解题思路： 相比于前序遍历 ...
2013-11-10 10:22 0 3113 推荐指数：
原题地址：http://oj.leetcode.com/problems/binary-tree-postorder-traversal/ 题意：实现后序遍历。递归实现比较简单，非递归实现。 解题思路：这道题的迭代求解比先序遍历和后序遍历要麻烦一些。假设一棵树是这样的： 1 / \ ...
原题地址：http://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/ 题意：根据二叉树的中序遍历和后序遍历恢复二叉树。 解题思路：看到树首先想到要用递归来解题。以这道题为 ...
Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 递归构造 ...
Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree ...
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, return [3,2,1]. Note ...
Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 非递归版本： 用一个栈来模拟递归的情况， 首先思考inorder ...
Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive ...
原题地址：http://oj.leetcode.com/problems/binary-tree-inorder-traversal/ 题意：二叉树的中序遍历。这道题用递归比较简单，考察的是非递归实现二叉树中序遍历。中序遍历顺序为：左子树，根，右子树。如此递归下去。 解题思路：假设树为： 1 / \ ...
