二叉树的遍历
关注
分享
扫一扫
文章平均质量分 67
stefanharden
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Binary Tree Preorder Traversal 二叉树的前序遍历
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 10:53:36 · 429 阅读 · 0 评论 -
Balanced Binary Tree 二叉平衡树
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 14:44:13 · 487 阅读 · 0 评论 -
Recover Binary Search Tree 修正二叉查找树
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 14:21:34 · 368 阅读 · 0 评论 -
Binary Tree Zigzag Level Order Traversa 二叉树Z形程序遍历
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 14:07:49 · 612 阅读 · 0 评论 -
Symmetric Tree 判断一棵树是否对称
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 14:36:08 · 511 阅读 · 0 评论 -
Same Tree 判断两棵树是否相等
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 14:23:11 · 541 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II 顺序链接二叉树每一层结点
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(N原创 2014-01-20 15:23:12 · 352 阅读 · 0 评论 -
Binary Tree Postorder Traversal 二叉树的后序遍历
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 10:59:18 · 531 阅读 · 0 评论 -
Binary Tree Inorder Traversal 二叉树的中序遍历
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 10:56:12 · 358 阅读 · 0 评论 -
Binary Tree Level Order Traversal II 二叉树的反向层序遍历
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 11:07:08 · 510 阅读 · 0 评论 -
Binary Tree Level Order Traversal 二叉树的层序遍历
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 11:02:17 · 505 阅读 · 0 评论 -
Flatten Binary Tree to Linked List 二叉树拉伸成链表
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla原创 2014-01-20 14:46:47 · 370 阅读 · 0 评论