后序遍历
文章平均质量分 74
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal(根据中序遍历和后序遍历构造二叉树)
原题网址:https://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原创 2016-05-24 00:12:37 · 447 阅读 · 0 评论 -
LeetCode 145. Binary Tree Postorder Traversal(二叉树后序遍历)
原题网址:https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1原创 2016-05-26 01:31:28 · 518 阅读 · 0 评论