数据结构
文章平均质量分 83
le119126
这个作者很懒,什么都没留下…
展开
-
leetcode 105-106:Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. /** * Definition for a binary tree node. * struct Tre原创 2015-10-17 15:00:29 · 601 阅读 · 0 评论 -
leetcode 解题报告 Word Ladder II
别人讲得很详细,题目有点难,就转 了:http://www.cnblogs.com/ShaneZhang/p/3748494.html Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginW转载 2015-11-19 20:22:15 · 607 阅读 · 0 评论 -
判断二叉树是否平衡、是否完全二叉树、是否二叉排序树
http://blog.csdn.net/zhaojinjia/article/details/11891523 来自剑指offer 求树的深度 用递归做很简单,只要知道递归出口语句的别写错。 [cpp] view plaincopyprint? struct BinaryTreeNode { int m转载 2015-10-12 10:28:56 · 944 阅读 · 0 评论 -
leetcode :二叉树的前中后序遍历非递归实现,以及根据前中后序构造二叉树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas原创 2015-10-21 21:55:45 · 660 阅读 · 0 评论