Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
"Adva"it!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by "Adva"it!
6
answers
1
GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P...
38.6k
views
commented
Jul 8, 2018
DS
gatecse-2008
data-structures
binary-search-tree
normal
+
–
4
answers
2
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...
18.4k
views
commented
May 4, 2017
Theory of Computation
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register