Fun_Coding的博客

验证节点是否一个空一个非空，验证值是否相等，迭代验证左右子树/** *Definition for a binary tree node. *struct TreeNode { *    int val; *    struct TreeNode *left; *    struct TreeNode *right; * }; */bool isSameTree

1：树为空，返回空 2：将树根赋给p指针，转置p的左右子树 3：迭代，对p的左右子树执行相同的操作 4：返回树根节点/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right;

Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your funct

Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s.int numTrees(int n) { if(n==0) return