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.
Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.
A database is a collection of data organized in a manner that facilitates updation, retrieval and management of the data. Searching an unindexed database having n keys will have a
whate is meant by the term heuristic
Write c++ function to traverse the threaded binary tree in inorder traversal
Linked List A linked list is a linear collection of data elements called nodes. The linear order is given by pointer. Every node is divided into 2 or more parts.
If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms? Your mission (sho
Enumerate about the concept of container A Container can have a size() operation. We can also ask (somewhat redundantly) whether a Container is empty. And even though a Contain
Definition: A set of data values & related operations that are accurately specified independent of any particular implementation. As the data values and operations are described
How to create multiple queue on single array?
explanation with algorithm
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