search
Log In
0 votes
70 views
How many ways the elements 1,2,3,4,5,6,7 can be inserted to AVL tree ( without any rotations involved ) such that 4 will be root?
in Algorithms 70 views

1 Answer

0 votes
48 will be the answer.
0
How did you get it?

Related questions

0 votes
1 answer
1
108 views
What is the time complexity of the following program?
asked Jan 4, 2019 in Algorithms Vipin Rai 108 views
0 votes
1 answer
2
118 views
how many of the above statements are true?
asked Mar 13, 2017 in Algorithms Shubhanshu 118 views
0 votes
0 answers
3
124 views
we define a new measure ,called GoldIndex(G,C).it takes two arguments as input namely a graph G and set of colors C respectively . the subroutine outputs an integer denoting the number of ways assigning colors to vertices in G such that at least two vertices in G have the ... i don't know where m i going wrong ,please help me- i know their solution is correct but i want to verify my approach-
asked Jan 29, 2019 in Graph Theory Prateek Raghuvanshi 124 views
0 votes
1 answer
4
156 views
L = { w $\epsilon$ {0,1} | w has equal occurrence of 001 and 010 } Is the language regular ?
asked Jan 20, 2019 in Theory of Computation Vipin Rai 156 views
...