0 votes 0 votes What is the largest possible number of internal nodes in a red-black tree with black height $4?$ DS data-structures binary-tree + – Lakshman Bhaiya asked Oct 27, 2018 Lakshman Bhaiya 2.3k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Lakshman Bhaiya commented Oct 27, 2018 reply Follow Share Testbook 0 votes 0 votes Utkarsh Joshi commented Oct 27, 2018 reply Follow Share Not in the syllabus 0 votes 0 votes Lakshman Bhaiya commented Oct 27, 2018 reply Follow Share Ok Thanks:) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The largest no of possible node is 2(log(4+1)) =2log5=1.397 Naman kumar1313 answered Apr 29, 2020 Naman kumar1313 comment Share Follow See all 0 reply Please log in or register to add a comment.