Computer Sciences > Gate 2022 > Binary Tree
Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index_______
Correct : 509
Similar Questions
Consider the following New-order strategy for traversing a binary tree:
Visit the root;
Visit the right subtree using New-order
Visit the left subtree usi...
Consider a rooted Binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having having exactly 4...
A binary tree T has 20 leaves. The number of nodes in T having two children is ________
Total Unique Visitors
Loading......