| | | | |

2016年10月28日

leetcode 108 Convert Sorted Array to Binary Search Tree ----- java

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 给一个排好序的数组，然后求搜索二叉树其实就是二分法，不难。阅读全文

posted @ 2016-10-28 20:51 xiaoba1203 阅读(163) 评论(0) 推荐(0) 编辑

leetcode 107 Binary Tree Level Order Traversal II ----- java

摘要： Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文

posted @ 2016-10-28 18:10 xiaoba1203 阅读(202) 评论(0) 推荐(0) 编辑

leetcode 106 Construct Binary Tree from Inorder and Postorder Traversal----- java

摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 和上一道题基本一样根据阅读全文

posted @ 2016-10-28 17:59 xiaoba1203 阅读(138) 评论(0) 推荐(0) 编辑

leetcode 105 Construct Binary Tree from Preorder and Inorder Traversal ----- java

摘要： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 给出前序遍历和中序遍历，然阅读全文

posted @ 2016-10-28 17:35 xiaoba1203 阅读(355) 评论(0) 推荐(0) 编辑

2016年10月28日

公告