博客
关于我
Objective-C实现binary tree traversal二叉树遍历算法(附完整源码)
阅读量:797 次
发布时间:2023-02-17

本文共 2723 字,大约阅读时间需要 9 分钟。

Objective-C?????????

???????

?Objective-C?????????????TreeNode???????????????

@interface TreeNode : NSObject@property (nonatomic, strong) NSNumber *value;@property (nonatomic, strong) TreeNode *left;@property (nonatomic, strong) TreeNode *right;@end

???????

?????Preorder Traversal?

???????????????????????????????????

- (void)preorderTraversal:(TreeNode *)node {    if (node == nil) return;        // ????    NSLog(@"?????%d", node.value);        // ?????    if (node.left) {        [self preorderTraversal:node.left];    }        // ?????    if (node.right) {        [self preorderTraversal:node.right];    }}
?????Inorder Traversal?

?????????????????????????????????

- (void)inorderTraversal:(TreeNode *)node {    if (node == nil) return;        // ?????    if (node.left) {        [self inorderTraversal:node.left];    }        // ????    NSLog(@"?????%d", node.value);        // ?????    if (node.right) {        [self inorderTraversal:node.right];    }}
?????Postorder Traversal?

??????????????????????????????????

- (void)postorderTraversal:(TreeNode *)node {    if (node == nil) return;        // ?????    if (node.left) {        [self postorderTraversal:node.left];    }        // ?????    if (node.right) {        [self postorderTraversal:node.right];    }        // ????    NSLog(@"?????%d", node.value);}

????

????????????????????????????????

#import 
@interface TreeNode : NSObject@property (nonatomic, strong) NSNumber *value;@property (nonatomic, strong) TreeNode *left;@property (nonatomic, strong) TreeNode *right;@end@interface BinaryTreeTraversal : NSObject- (void)preorderTraversal:(TreeNode *)node;- (void)inorderTraversal:(TreeNode *)node;- (void)postorderTraversal:(TreeNode *)node;@end@implementation BinaryTreeTraversal- (void)preorderTraversal:(TreeNode *)node { if (node == nil) return; NSLog(@"?????%d", node.value); if (node.left) { [self preorderTraversal:node.left]; } if (node.right) { [self preorderTraversal:node.right]; }}- (void)inorderTraversal:(TreeNode *)node { if (node == nil) return; if (node.left) { [self inorderTraversal:node.left]; } NSLog(@"?????%d", node.value); if (node.right) { [self inorderTraversal:node.right]; }}- (void)postorderTraversal:(TreeNode *)node { if (node == nil) return; if (node.left) { [self postorderTraversal:node.left]; } if (node.right) { [self postorderTraversal:node.right]; } NSLog(@"?????%d", node.value);}@end

????????

?????????????????????????????????????????????

  • ?????????????????????????????????
  • ???????????????????????????????????
  • ??????????????????????????????????????

??????????????????????????????

转载地址:http://mdnfk.baihongyu.com/

你可能感兴趣的文章
Objective-C实现articulation-points(关键点)(割点)算法(附完整源码)
查看>>
Objective-C实现atoi函数功能(附完整源码)
查看>>
Objective-C实现average absolute deviation平均绝对偏差算法(附完整源码)
查看>>
Objective-C实现average mean平均数算法(附完整源码)
查看>>
Objective-C实现average median平均中位数算法(附完整源码)
查看>>
Objective-C实现average mode平均模式算法(附完整源码)
查看>>
Objective-C实现avl 树算法(附完整源码)
查看>>
Objective-C实现AvlTree树算法(附完整源码)
查看>>
Objective-C实现backtracking Jump Game回溯跳跃游戏算法(附完整源码)
查看>>
Objective-C实现BACKTRACKING 方法查找集合的幂集算法(附完整源码)
查看>>
Objective-C实现bailey borwein plouffe算法(附完整源码)
查看>>
Objective-C实现balanced parentheses平衡括号表达式算法(附完整源码)
查看>>
Objective-C实现base64加密和base64解密算法(附完整源码)
查看>>
Objective-C实现base64加解密(附完整源码)
查看>>
Objective-C实现base64编码 (附完整源码)
查看>>
Objective-C实现base85 编码算法(附完整源码)
查看>>
Objective-C实现basic graphs基本图算法(附完整源码)
查看>>
Objective-C实现BCC校验计算(附完整源码)
查看>>
Objective-C实现bead sort珠排序算法(附完整源码)
查看>>
Objective-C实现BeadSort珠排序算法(附完整源码)
查看>>