adplus-dvertising
frame-decoration

Question

The size value of various nodes in a weight balanced tree are
leaf – zero

internal node – size of it’s two children

is this true?

a.

true

b.

flase

c.

May be

d.

Can't say

Posted under Data Structures and Algorithms

Answer: (a).true

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The size value of various nodes in a weight balanced tree are leaf – zero internal node – size of it’s two children is this true?
Add Comment

Similar Questions

Discover Related MCQs

Q. What are splay trees?

View solution

Q. Which of the following property of splay tree is correct?

View solution

Q. Why to prefer splay trees?

View solution

Q. Is it true that splay trees have O(logn) amortized complexity ?

View solution

Q. What is a splay operation?

View solution

Q. Which of the following options is an application of splay trees?

View solution

Q. When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

View solution

Q. What is the disadvantage of using splay trees?

View solution

Q. What is a threaded binary tree traversal?

View solution

Q. What are the disadvantages of normal binary tree traversals?

View solution

Q. What may be the content of a node in threaded binary tree?

View solution

Q. What are null nodes filled with in a threaded binary tree?

View solution

Q. The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?

View solution

Q. What are double and single threaded trees?

View solution

Q. In a max-heap, element with the greatest key is always in the which node?

View solution

Q. Heap exhibits the property of a binary tree?

View solution

Q. What is the complexity of adding an element to the heap.

View solution

Q. The worst case complexity of deleting any arbitrary node value element from heap is

View solution

Q. Heap can be used as ________________

View solution

Q. An array consist of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

View solution
View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....