摘要: Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. Subscribe to 阅读全文
posted @ 2016-01-31 18:03 sdlwlxf 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2016-01-31 16:04 sdlwlxf 阅读(153) 评论(0) 推荐(0) 编辑