Binary tree always has nodes with maximum children of 2. Index starts with 1 such that index of j is 1, f is 2, z is 7 and so on. Root is single node always on top of the tree, in this case its j.

Javascript-Algorithms-And-Data-Structures / Basic Data Structures / Implementation of Binary Search Tree in Javascript / Trees.md Cannot retrieve latest commit at this time.