Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged binarytree
0
votes
0
answers
ISI 2020 pcb cse
In a binary tree T, for a node v, the LEFTHEIGHT(v) is the length of the longest path from v to any leaf in the left subtree of v. If v has no left child then LEFTHEIGHT(v) = 0. The RIGHTHEIGHT(v) is defined accordingly. A node v ... HEIGHT(v) RIGHTHEIGHT(v) ≤ 1. Design an efficient algorithm that, given a binary tree, enumerates all the nodes which are properly balanced.
asked
Mar 24
in
DS
by
Dn0047
(
10
points)

4
views
binarytree
0
votes
0
answers
Cormen 3e BST Exercise12.28 page no294
Prove that no matter what node we start at in a heighth binary search tree, k successive calls to TREESUCCESSOR take O(k + h) time
asked
Jan 3
in
DS
by
aditi19
(
55
points)

16
views
data_structure
bst
binarytree
cormen
+2
votes
0
answers
MadeEasy Test Series  Worst case height in Binary tree
asked
Dec 7, 2019
in
Algorithms
by
luc_Bloodstone
(
36
points)

17
views
madeeasytestseries
algorithms
binarytree
data_structure
+1
vote
0
answers
No of binary trees with n labelled nodes
So I followed this link and have doubt regarding the no of ways of choosing edges with $n$ labelled nodes. Let's say I have 3 nodes  $A, B, C$ $l_X$ : left child of a node $X$ $r_X$ : right child of a node $X$ Now, any ... be considered that both $(l_A,r_A)$ and $(r_A,l_A)$ produces 1 unique binary trees each. Is this the correct way to think about this?
asked
Nov 21, 2019
in
Combinatory
by
avistein
(
355
points)

18
views
binarytree
permutationandcombination
0
votes
0
answers
self doubt about tournament tree
Given an array, Find the 1st & 2nd largest element with min. no. of comparison?? answer is n1 + logn – 1 = n + logn – 2 here tournament tree is used.Now I’m having doubt that after finding Largest element in (n1) comparison, how can we find 2nd largest in (logn – 1) time??? anyone please explain.
asked
Oct 9, 2019
in
DS
by
MRINMOY_HALDER
(
37
points)

19
views
data_structure
binarytree
0
votes
1
answer
Self Doubt  Can a Binary tree be full and complete and the same time?
asked
Sep 13, 2019
in
Programming
by
Nannu Singh
(
6
points)

18
views
data_structure
binarytree
0
votes
1
answer
Is Preorder is same as depth first search ?
asked
Aug 17, 2019
in
Programming
by
him0000
(
13
points)

11
views
binarytree
0
votes
0
answers
Find kth smallest element in a binary search tree in most Optimum way.
asked
Aug 16, 2019
in
Algorithms
by
iarnav
(
76
points)

16
views
algorithms
binarytree
0
votes
1
answer
How to prove Avl tree of height h contain at least 2^h nodes?
asked
Jul 26, 2019
in
DS
by
iarnav
(
76
points)

22
views
binarytree
data_structure
0
votes
0
answers
In a Binary tree, given Leaf nodes = 200 then how many nodes will be of degree 1?
asked
Jul 25, 2019
in
DS
by
iarnav
(
76
points)

12
views
binarytree
data_structure
algorithms
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Apr 2020
!KARAN
36 Points
lazygatestudent
5 Points
AngeloAlba89
5 Points
WillKnisley
5 Points
TamieMcvay4
5 Points
Satyaki Das
5 Points
akansha03
5 Points
srestha
3 Points
Shivateja MST
2 Points
souren
2 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,511
questions
1,656
answers
10,449
comments
90,037
users