喜刷刷
Showing posts with label
post-order traversal
.
Show all posts
Showing posts with label
post-order traversal
.
Show all posts
Tuesday, November 11, 2014
[LeetCode] 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 tre...
Monday, November 10, 2014
[LeetCode] 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 \ ...
›
Home
View web version