algo-binary-tree Hard task from my algorythm classes(i'm proud of it) The task is to delete nodes with height of k. (Height of node A is a length of the longest chain of nodes containing A)