[Leetcode] Binary Tree PosterOrder Travel

后序遍历的遍历中，某一个节点要被输出，在两种情况下：当前节点的左右孩子为空；当前节点的左右孩子已经被访问。

第一种情况非常容易判断

第二种情况需要记录访问过的节点，显然当前节点如果有孩子，则对它的访问会紧跟在它的孩子节点之后，无论是左右。

所以只需记录每次访问的节点，就Ok!

[1]http://www.cnblogs.com/changchengxiao/p/3416402.html

转载于:https://www.cnblogs.com/deepblueme/p/4675482.html

[Leetcode] Binary Tree PosterOrder Travel相关推荐

[LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)
目录: 1.Binary Tree Level Order Traversal - 二叉树层次遍历 BFS 2.Binary Tree Level Order Traversal II - 二叉树层次 ...
Leetcode | Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. ...
LeetCode Binary Tree Right Side View(搜索)
问题:给出一个二叉树,要求输出右视图思路:因为要求输出右视图.可以考虑使用深度优先搜索或者广度优先搜索. 使用深度优先搜索时,以非递归形式,将左右子树入栈,同时使用哈希表记录深度与对应右视图的值. ...
LeetCode Binary Tree Preorder Traversal(二叉树的前序遍历)
问题:给出一个二叉树,输出前序遍历思路: 自顶向下遍历过程中,将当前结点的值加入到list中,然后处理左.右子树具体代码参考: https://github.com/wuli2496/OJ/tre ...
[LeetCode] Binary Tree Postorder Traversal 二叉树的后序遍历
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary ...
[LeetCode] Binary Tree Postorder题解
Binary Tree Postorder Given a binary tree, return the postorder traversal of its nodes' values. For ...
[Leetcode] Binary Tree Maximum Path Sum
这是LeetCode上的一道题目,需要求二叉树中两点路径的最大和.原题是 https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/ ...
[leetcode] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...
LeetCode Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...

[Leetcode] Binary Tree PosterOrder Travel

[Leetcode] Binary Tree PosterOrder Travel相关推荐

最新文章

热门文章