We propose abstract observation tables, an abstract data type for learning deterministic weighted tree automata in Angluin's minimal adequate teacher model. Besides the "classical" observation table, we show that abstract observation tables can also be implemented by observation trees. The advantage of the latter is that they often require fewer queries to the teacher.