Added by VU Lectures
on December 1, 2010
3 years ago
2.18K Views0 Comments0 Likes
1.79K Views0 Comments0 Likes
1.19K Views0 Comments0 Likes
1.12K Views0 Comments0 Likes
Your email address will not be published. Required fields are marked *
Notify me of follow-up comments by email.
Notify me of new posts by email.
Its fantastic I just revised so much
I realy love those lectures
it’s just fantastic
Sir, VU main java ku nae kerwaty???
Ask by emailing to Director of VU.
Kyun k JAVA mushkil jo hai……..
It’s awesome… They helped me a lot… Make my concepts clear and taking excellent GPA.
Hmmmmm nice lecture.
I have few question on data structure. Can I expect answer from you? Your lectures are awesome.
Please post your questions so visitors of this websites reply to you with your answer.
Please provide me solution for Preorder and postorder traversals of a binary tree given as below:
Preorder: u1 u2 u3 u4 u10 u8 u5 u9 u6 u11 u7
Postorder: u4 u10 u3 u8 u2 u9 u11 u7 u6 u5 u1
Obtained a binary tree, which resembles with traversals?
my mail mitendra13@gmail
My other question is:
Merge operation between two heap trees
First tree has 92 as root while 45 and 67 are its sub tree and again 38 and 59 are sub tree of 45
Second tree has two sub tree 19 and 80 , again 19 has two sub tree (92,93) and 80 has one sub tree 96
H1: A max Heap H2: A min Heap
Does anybody has idea of above question? or May I expect answer from VU