Fast please

3) Assume in a room we have N distinct objects. An image classification system detects every image sequentially( think for loop nxm) a decision tree is constructed, every object is classified first without looking its dimension(lengthxheight). Write an algorithm such that: first add object than (N), M objects classified under it i.e table under the books so . Write an algorithm to construct a tree and find number of pencils on the book on the table if exist. Using splay trees find an object showing the hierarchy which is on top in descending order