Register

Binary tree

189 views
0 votes
0 votes
A weight balanced tree is a binary tree in which for each node the number of nodes in LST ias at least half and almost twice the number of nodes in RST. Maximum possible height of such a tree on n nodes is best described by

log n base 2

log n base 4/3

log n base 3

log n base 3/2
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
someshawasthi asked Feb 27, 2023
465 views
binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing value 4?
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many differen...
User Avatar
0 votes
0 votes
1 answer
3
srestha asked May 3, 2019
1,950 views
Made Easy Test Series:DS-Binary Tree
Consider the following function foobar(), which takes binary tree as input. int foobar(struct node *root){ if(!root) return 0; if((!root->left)&&(!root->right)) return 10; else{ int i=foobar(root->left); int j=foobar(root-> ... $C)$ Sum of leaves node of binary tree. $D)$ None What return $10$ actually means?
Consider the following function foobar(), which takes binary tree as input.int foobar(struct node *root){ if(!root) return 0; if((!root->left)&&(!root->right)) return 10;...
User Avatar
Link Copied!