Abstract: In this paper,a storing model for quadtree called RVA tree is presented.Using itcan make the quadtrees stored in less spaces with random visiting ability to subtrees unchanged.Discussions of operations in image processing on RVA trees show that it isan efficient storing structure for quadtree.These methods and techniques can be alsoapplied to octtrees of 3-D objects and K-D objects.Finally,for general trees,thisidea is generalized and corresponding representing structure is offered.