Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Red Black Tree
Lakshman Patel RJIT
asked
in
DS
Oct 28, 2018
1,580
views
0
votes
0
votes
What is the largest possible number of internal nodes in a red-black tree with black height $4?$
data-structures
binary-tree
Lakshman Patel RJIT
asked
in
DS
Oct 28, 2018
by
Lakshman Patel RJIT
1.6k
views
answer
comment
Follow
share this
share
4 Comments
Show 2 previous comments
by
Lakshman Patel RJIT
commented
Oct 28, 2018
reply
Follow
share this
Testbook
0
0
by
Utkarsh Joshi
commented
Oct 28, 2018
reply
Follow
share this
Not in the syllabus
0
0
by
Lakshman Patel RJIT
commented
Oct 28, 2018
reply
Follow
share this
Ok Thanks:)
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
The largest no of possible node is 2(log(4+1))
=2log5=1.397
Naman kumar1313
answered
Apr 29, 2020
by
Naman kumar1313
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
damz1499
asked
in
DS
Dec 29, 2022
52
views
Tree
damz1499
asked
in
DS
Dec 29, 2022
by
damz1499
52
views
data-structures
binary-tree
probability
1
vote
1
vote
1
answer
2
Ram Swaroop
asked
in
DS
Jan 28, 2019
996
views
Made easy tree height
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes. Then the value of X will be Answer 9
Ram Swaroop
asked
in
DS
Jan 28, 2019
by
Ram Swaroop
996
views
data-structures
binary-tree
1
vote
1
vote
0
answers
3
Nandkishor3939
asked
in
DS
Jan 25, 2019
385
views
Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)
Nandkishor3939
asked
in
DS
Jan 25, 2019
by
Nandkishor3939
385
views
data-structures
binary-tree
0
votes
0
votes
1
answer
4
Prince Sindhiya
asked
in
DS
Jan 2, 2019
454
views
Zeal Test Series 2019: Programming & DS - Binary Tree
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
Prince Sindhiya
asked
in
DS
Jan 2, 2019
by
Prince Sindhiya
454
views
zeal
data-structures
binary-tree
zeal2019
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Programming
(3.9k)
DS
(1.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@Aakash_Bhardwaj all the best bro . For your...
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
