Data Structured67_q4a-bst-node-relation
BST Node Relation
a09b70a0-fe4e-43c2-99f7-036f046c1a6e.cppC++
1// Loading code...Selected Submission
40 / 100
0.111s
1968 KB
Tree
Time Comp.
O(log n)
Space Comp.
O(1)
Readability
4/10
"The code operates on a Binary Search Tree (BST) implemented using a custom `map_bst` class. It determines the relationship between two nodes within the tree, utilizing iterative traversal to find the nodes and compare their positions. The core data structure is a Tree, specifically a BST, and the code heavily relies on its properties for node comparison."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #42 | 40 | 11/18/2024 |
| Try #41 | 40 | 11/18/2024 |
| Try #40 | 0 | 11/18/2024 |
| Try #39 | 40 | 11/18/2024 |
| Try #38 | 20 | 11/18/2024 |
| Try #37 | 0 | 11/18/2024 |
| Try #36 | 100 | 11/18/2024 |
| Try #35 | 100 | 11/18/2024 |
| Try #34 | 20 | 11/18/2024 |
| Try #33 | 20 | 11/18/2024 |
| Try #32 | 0 | 11/18/2024 |
| Try #31 | 20 | 11/18/2024 |
| Try #30 | 20 | 11/18/2024 |
| Try #29 | 0 | 11/18/2024 |
| Try #28 | 0 | 11/18/2024 |
| Try #27 | 20 | 11/18/2024 |
| Try #26 | 20 | 11/18/2024 |
| Try #25 | 20 | 11/18/2024 |
| Try #24 | 20 | 11/18/2024 |
| Try #23 | 20 | 11/18/2024 |
| Try #22 | 0 | 11/18/2024 |
| Try #21 | 20 | 11/18/2024 |
| Try #20 | 20 | 11/18/2024 |
| Try #19 | 20 | 11/18/2024 |
| Try #18 | 0 | 11/18/2024 |
| Try #17 | 20 | 11/18/2024 |
| Try #16 | 20 | 11/18/2024 |
| Try #15 | 20 | 11/18/2024 |
| Try #14 | 20 | 11/18/2024 |
| Try #13 | 20 | 11/18/2024 |
| Try #12 | 20 | 11/18/2024 |
| Try #11 | 0 | 11/18/2024 |
| Try #10 | 20 | 11/18/2024 |
| Try #9 | 0 | 11/18/2024 |
| Try #8 | 0 | 11/18/2024 |
| Try #7 | 0 | 11/18/2024 |
| Try #6 | 0 | 11/18/2024 |
| Try #5 | 0 | 11/18/2024 |
| Try #4 | 0 | 11/18/2024 |
| Try #3 | 0 | 11/18/2024 |
| Try #2 | 0 | 11/18/2024 |
| Try #1 | 0 | 11/18/2024 |