👉 In computational complexity theory, the term "hurdlewise" is used to describe a problem where the solution space consists of multiple decision variables. This means that there are different possible values for each variable and the algorithm must choose one of these values. For example, consider a binary search tree. The tree can be represented by an array where each element represents the value at that node. If you have to find the root of the tree (the lowest leaf), you need to traverse through all nodes