(node)
| 335 | |
| 336 | |
| 337 | def depth(node): |
| 338 | if node is None: |
| 339 | return 0 |
| 340 | l_depth, r_depth = 0, 0 |
| 341 | if node.left: |
| 342 | l_depth = depth(node.left) |
| 343 | if node.right: |
| 344 | r_depth = depth(node.right) |
| 345 | # print(node.info, l_depth, r_depth) |
| 346 | return 1 + max(l_depth, r_depth) |
| 347 | |
| 348 | |
| 349 | t = BinarySearchTree() |