Programming and Data Structure Tree Depth of Tree

The maximum height of a red-black tree with n internal nodes is:

1

2 + log n

2

llog(n + 1)

3

2 log (n + 1)

4

2 log n

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters