iOS实现树类

最近项目里需要实现一个可伸缩的多级树形目录。于是实现的思路是利用递归调用树类实现。

先定义一个树的类：

@interface RowData : NSObject

@property (nonatomic) BOOL isExpandable;
@property (nonatomic) BOOL isExpanded;
@property (nonatomic) NSIntegar level;
@property (nonatomic, retian) NSString *rowName;
@property (nonatomic, retian) NSMutableArray *rowDataArray;

@end

类中定义为，在每一个类实例里面都有一个数组rowDataArray元素来存放节点下面的分支节点。

 

递归调用方式：

- (NSMutableArray *)getRowData:(NSDictionary *)dic withLevel:(Integar)level
{
  NSMutableArray *rowDataArray = [NSMutableArray array];
  NSEnumerator *enumerator = [dic keyEnumerator];
  id key;
  while (key = [enumerator nextObject]) {
    RowData *rowData = [RowData alloc] init];
    rowData.rowName = key;
    rowData.level = level;

    if ([[dic objectForKey:key] isKindOfClass:[NSDictionary class]]) {
      rowData.isExpandable = YES;
      rowData.rowDataArray = [self getRowData:[dic objectForKey:key] withLevel:level + 1];
    }
    [rowDataArray addObject:rowData];
    [rowData release];
  }

  return rowDataArray;
}