Talk:Red black trees: Difference between revisions
Content added Content deleted
(Created page with "Each node has only 3 states instead of 4 states as with AVL Trees. This may have implications in biology. It would be interesting to know whether the search trees of the brain...") |
No edit summary |
||
| Line 1: | Line 1: | ||
Each node has only 3 states instead of 4 states as with AVL Trees. This may have implications in biology. It would be interesting to know whether the search trees of the brain are 3 state or 4 state, i.e. Red/Black or AVL Tree. Three states may be more susceptible to representation in biology. [[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 10:55, 11 July 2016 (UTC) |
Each node has only 3 states instead of 4 states as with AVL Trees. This may have implications in biology. It would be interesting to know whether the search trees of the brain are 3 state or 4 state, i.e. Red/Black or AVL Tree. Three states may be more susceptible to representation in biology. As an aside, 4 state trees can be made into 3 state trees if each node has a separate isHeader boolean. [[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 10:55, 11 July 2016 (UTC) |
||
Revision as of 10:57, 11 July 2016
Each node has only 3 states instead of 4 states as with AVL Trees. This may have implications in biology. It would be interesting to know whether the search trees of the brain are 3 state or 4 state, i.e. Red/Black or AVL Tree. Three states may be more susceptible to representation in biology. As an aside, 4 state trees can be made into 3 state trees if each node has a separate isHeader boolean. NNcNannara (talk) 10:55, 11 July 2016 (UTC)