中序遍历
文章平均质量分 78
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal(从前序遍历和中序遍历构造二叉树)
原题网址:https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume t原创 2016-05-24 00:12:34 · 447 阅读 · 0 评论 -
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 98. Validate Binary Search Tree(校验二叉搜索树)
原题网址:https://leetcode.com/problems/validate-binary-search-tree/Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtre原创 2016-05-23 00:39:15 · 492 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree(对称的树)
原题网址:https://leetcode.com/problems/symmetric-tree/Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:原创 2016-05-23 03:22:34 · 705 阅读 · 0 评论 -
LeetCode 94. Binary Tree Inorder Traversal(二叉树的中序遍历)
原题网址:https://leetcode.com/problems/binary-tree-inorder-traversal/Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1原创 2016-05-23 00:35:01 · 1002 阅读 · 0 评论 -
LeetCode 99. Recover Binary Search Tree(修复二叉搜索树)
原题网址:https://leetcode.com/problems/recover-binary-search-tree/Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A sol原创 2016-05-23 00:39:29 · 615 阅读 · 0 评论