Is a tree with all black nodes a red black tree?

A red-black tree is simply a binary-tree representation of a 2-3-4 tree . Any red node in a red-black tree corresponds to a piece of its parent node in the analagous 2-3-4 tree. For example.

It is possible to have a proper red-black tree that has all black nodes. Trivially, a RBTree with only one node, or with the only leaf nodes being direct children of the root, will be all back nodes.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.

Related Questions