braden1996 / cracking-the-coding-interview-typescript Goto Github PK

These exercises were completed using the (now deprecated) AdjacencyList util

Would be nice to write unit-tests validating that these data-structures (and they're given methods) work as expected.

Calculate length of longest branch and check that it is less than Math.floor(totalNumberOfNodes).

Came across your repo as I was solving the cracking the coding interview questions. I'm very puzzled by solutions to Chapter 5, question 5. The question is titled Titled Next Number.

Do you happen to understand why position is equal to c0 + c1.

Just as an example from the book:
Binary representation of number 13948 is: 11011001111100
c0 is: 5
c1: 9

whereas the rightmost non leading 0 should be position index 7. Whereas your solution as well as the book solution suggests it is c0+c1 = 14. Which seems incorrect.

Do you have any insight as to why that might be the case?

Currently, there are no checks in place to verify that the Node is actually part of a tree. This means, this function may recurse forever (until crash).