(param)
| 218 | |
| 219 | |
| 220 | def parseTreeNode(param): |
| 221 | # LCP 194题的参数 是整数 |
| 222 | if (isNumber(param)): |
| 223 | return TreeNode(param) |
| 224 | if (not isList(param)): |
| 225 | onParameterError() |
| 226 | |
| 227 | root = None |
| 228 | fifo = [] |
| 229 | i = 0 |
| 230 | while (i < len(param)): |
| 231 | if (i == 0): |
| 232 | root = TreeNode(param[i]) |
| 233 | i += 1 |
| 234 | fifo.append(root) |
| 235 | continue |
| 236 | |
| 237 | parent = fifo.pop(0) |
| 238 | if (param[i] != None): |
| 239 | left = TreeNode(param[i]) |
| 240 | parent.left = left |
| 241 | fifo.append(left) |
| 242 | |
| 243 | if (i + 1 < len(param) and param[i + 1] != None): |
| 244 | right = TreeNode(param[i + 1]) |
| 245 | parent.right = right |
| 246 | fifo.append(right) |
| 247 | |
| 248 | i = i + 2 |
| 249 | return root |
| 250 | |
| 251 | |
| 252 | def parseParameter(index, paramType, param): |
no test coverage detected