Register

A BST is generated (by successive insertion of nodes) from each permutation of keys from the set {1,2,3,4,5,6,7}. How many permutations determine trees of height two?

351 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · My marks are 59 in s...Next → · Consider a binary se...
← Previous in category · GO Classes | IIITH P...Next in category → · Consider a binary se...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
1.2k
1.2k views
AKS1236 asked May 18, 2022
1,226 views
A question paper is divided into two parts A and B and each part contains 5 questions. In how many ways a student can answer the question paper, if he has to solve total 6 questions including atleast 2 from each section.
I solved the question using the logic first select two questions from each sections. ($\binom{5}{2} * \binom{5}{2}$). Then from remaining 6 questions choose any 2. theref...
1 1 vote
1 1 answer
1.4k
1.4k views
afnanaish asked Apr 23, 2022
1,397 views
Two nodes (A and B) are on the same network, and distanced by 500-meter. The two nodes are connected via 3 switches, each with a delay of 5 µs. Suppose that both of A and B transmit 1500 bytes at the same exact time and their frames collide. A chooses to retransmit immediately after jam signal is received, and B chooses to retransmit after 50 µs of receiving the jam signal. Assume the transmission speed is 10 Mbps, the channel is CSMA/CD with backoff intervals that are multiples of, the jam signal takes 10 µs to transmit, and the inter-frame gap is 9.6 µs. Find the time required to deliver A’s packet to B
1 1 vote
2 answers 2 answers
6.4k
6.4k views
confused_luck asked Jun 4, 2015
6,388 views
how many distinct 4-digits integers one can make from the digits 1,3,3,7,7,8 ? Is there and method or we have to go by enumerating the possibilites ?