This function takes all inner nodes of degree more than 4 and replaces them with a small binary tree. In the current implementation every high degree node is replaced with a chain. In this way this step of the procedure is quick and we can attack bigger trees.
1 |
T |
A tree |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.