A binary tree of depth "d" is an almost complete binary tree if

 A) Every leaf in the tree is either at level "d" or at level "d-1" 

B)  For any node "n" in the tree with a right descendent at level "d" all the left descendents of "n" that are leaves, are also at level "d"

 

Posted Date: 5/10/2013 12:56:03 AM | Location : United States

Ask an Expert

Thanks for suggesting me this answer, appreciate your knowledge. Posted by | Posted Date: 5/10/2013 12:56:18 AM

Related Discussions:- A binary tree of depth "d" is an almost complete binary tree, Assignment Help, Ask Question on A binary tree of depth "d" is an almost complete binary tree, Get Answer, Expert's Help, A binary tree of depth "d" is an almost complete binary tree Discussions

Write discussion on A binary tree of depth "d" is an almost complete binary tree
Your posts are moderated

Write your message here..

Related Questions

Procedure to delete all terminal nodes of the tree, Q. Let a binary tree 'T... Q. Let a binary tree 'T' be in memory. Write a procedure to delete all terminal nodes of the tree.       A n s . fun ction to Delete Terminal Nodes from Binary Tree

Recursive function , Q. Write down the recursive function to count the numb... Q. Write down the recursive function to count the number of the nodes in the binary tree.    A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt

Time required to delete a node x from a doubly linked list, The time needed... The time needed to delete a node x from a doubly linked list having n nodes is O (1)

Algorithm for sorting a deck of cards, What is wrong with the following alg... What is wrong with the following algorithm for sorting a deck of cards (considering the basic properties of algorithms)? I. Put the cards together into a pile II. For each ca

Determine relevancy and relative position of two polygons, Comparison Techn... Comparison Techniques There are several techniques for determining the relevancy and relative position of two polygons. Not all tests may be used with all hidden-surface algori

Siso-4bit register, explain working of siso-register to store 1011 and show... explain working of siso-register to store 1011 and show timing diagram &table

Which are the two standard ways of traversing a graph, Which are the two st... Which are the two standard ways of traversing a graph? i. The depth-first traversal   ii. The breadth-first traversal

Merge sorting, ESO207: Programming Assignment 1 Due on 6 Sept, 2015. To be ... ESO207: Programming Assignment 1 Due on 6 Sept, 2015. To be submitted online. Problem In this assignment you are required to implement k-way Merge Sort algorithm. In this version p

Graph search using iterative deepening, Prove that uniform cost search and ... Prove that uniform cost search and breadth- first search with constant steps are optimal when used with the Graph-Search algorithm (see Figure). Show a state space with varying ste

Accept a file and form a binary tree - huffman encoding, Huffman Encoding i... Huffman Encoding is one of the very simple algorithms to compress data. Even though it is very old and simple , it is still widely used (eg : in few stages of JPEG, MPEG etc). In t