Home/ Questions/Q 6552283
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-25T12:26:27+00:00

Suppose in a given binary tree if each node contains number of child elements

  • 0

Suppose in a given binary tree if each node contains number of child elements, then what is the optimal way to find k’th smallest element in the tree ?

Please note this is not regular BST. Each node is containing number of child element under it.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team
    find_element(root, k)

    if(root.left.nchildren + 1 == k - 1) 
        return root;

    if(root.left.nchildren + 1 >= k)
        return find_element(root.left, k)             

    else 
        return find_element(root.right, k - (root.left.children + 1))
    • 0