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.
WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO POSTFIX FORM ALSO TRACE ALG ON ((A+B)*C-(D-E)$F+G)
algorithm for multiplication of two sparse matrices using linked lists..
Representation of Linked list in Memory:- Each node has an info part and a pointer to the next node also known as link. The number of pointers is two in case of doubly linked
red black tree construction for 4,5,6,7,8,9
Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of
The data structure needed to evaluate a postfix expression is Stack
Q. Write down the binary search algorithm and trace to search element 91 in following given list: 13 30 62 73 81 88 91
do you have expert in data mining ?
Write an algorithm for compound interest.
how to implement multiple stack using single dimension array in c
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