KU-CSASR
KU
Sign in.
Welcome back. Enter your details to continue.
Email
Password
Sign in
No account?
Create one
Kathmandu University · Dept. of Computer Science & Engineering
BST insertion को time complexity के हो?
Average case मा O(log n), तर worst case मा O(n), जब tree एकदम skewed हुन्छ।
0:52
1:02