是否可以将AVL树按两个属性排序

I am implementing my own data structure for storing objects, these objects have an ID and also a date attached. The operations I must implement require me to sometimes return say an array in date order, or find an object by its ID. I am just thinking about this and it might become obviously impossible when I sit down to code it but I wonder, is it possible to have say, Node left1, Node left2, Node right1, Node right2 and then implement two simultaneous adding functions to have some kind of double tree where links result in a tree sorted by date and a tree sorted by ID?I am implementing my own data structure for sto