Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to the Binary trees 1)Strictly Binary Tree 2) Complete Binary Tree 3) Almost Complete Binary Tree
Ans:
A binary tree is a tree in which no nodes can posses' more than two children.
Figure drawn below shows us that the binary tree consists of the root and two subtrees, Tl and Tr, both of which could possibly be empty.
The highest numbers of nodes a binary tree of depth d can have is 2 d+1-1.
(i) Strictly Binary Tree:- If every non leaf node in binary tree has neither the left tree nor the right tree empty subtrees , then the tree is known as a strictly binary tree.
(ii) Complete Binary Tree:- The complete binary tree of depth d is that strictly binary tree whose all the leaves are at level D.
(iii) Almost Complete Binary Tree:- The binary tree of depth d is an almost complete binary tree if and only if: 1.Any node end at level less than d-1 has two children. 2. for any node nd in the tree with
(iv) a right descendant at the level d, nd should have a left child and every descendant of the nd is either a leaf at level d or has two children.
how to draw a 5 inch square on the screen using * symbol
Determine about the Post conditions assertion A post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ
Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }
In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the
c++ To calculate the amount to be paid by a customer buying yummy cupcakes for his birth day party
Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.
Define what an algorithm is and outline the characteristics of a good algorithm.
Q. Describe the representations of graph. Represent the graph which is given to us using any two methods Ans: The different ways by which we can represent graphs are:
perform the following length operation LENGTH("welcome to ICA")=
B Tree Unlike a binary-tree, every node of a B-tree may have a variable number of keys and children. The keys are stored in non-decreasing order. Every key has an associated ch
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd