1.二叉搜索树第k小的节点 2.给一个数组类似[["0","1"],["a","b"],["m","n"]],得到结果["0am","0an","0bm","0bn","1am","1an","1bm","1bn"] 3.给出number和N,求解去掉N个数字后的最大值,比如当number=8910,N=1时,可以去掉一个数8得到最大值910 4.用Array.reduce实现Array.map 5.给出一个数组[1,2,3,4,5],用setTimeout每隔1s输出一个数 6.用CSS实现左中右布局,左右宽度为200px,中间的为自适应宽度 7.实现P...