摘要： This is only a DP problem to count the number of all the possible combination(here is the unique binary tree). We can easily find that when n = 0 or 1... 阅读全文

摘要： Use DP to generate unique distinct binary trees;Create to two integer value, one "start" to represent the lowest value, and the other "end" to represe... 阅读全文

摘要： Inoder traversal means that traverse the left subtree of current node first, than display current node's value, afterwards traverse the right subtree ... 阅读全文