smallfish_yy的专栏

Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Analysis:  1. Get the middle element of the current array and construct the root with such value.

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. Note: Recursive solut

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20

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 example: Given binary tree {3,9,20,#,#,15,7},

Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary

http://blog.youkuaiyun.com/ithomer/article/category/694817

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. Analysis:  /** * Definition for singly-linked list. * public class ListNode { *