二叉树
文章平均质量分 81
fxy流年无悔
不要留下太多遗憾
展开
-
7-二叉树-面试题07. 重建二叉树-剑指offer
Java:/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */import java.util.Arrays...原创 2020-04-09 10:56:29 · 138 阅读 · 0 评论 -
递归-68.2 普通二叉树-同-236. 二叉树的最近公共祖先
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { p...原创 2020-04-26 16:29:36 · 130 阅读 · 0 评论 -
递归-面试题55 - II. 平衡二叉树
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { p...原创 2020-04-25 15:02:40 · 160 阅读 · 0 评论 -
递归-面试题55 - I. 二叉树的深度
解题思路:拿到树的题目就递归,递归不了吃亏,递归不了上当。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; }...原创 2020-04-25 14:46:19 · 126 阅读 · 0 评论 -
8-二叉树-二叉树的下一个结点-剑指offer
Java:解题思路:中序遍历的过程:先遍历树的左子树,再遍历根节点,最后再遍历右子树。所以最左节点是中序遍历的第一个节点。void traverse(TreeNode root) { if (root == null) return; traverse(root.left); visit(root); traverse(root.right);}...原创 2020-04-09 18:03:39 · 90 阅读 · 0 评论 -
po3437求出有序树转化为二叉树前后的高度 Tree Grafting
Tree GraftingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2049 Accepted: 901DescriptionTrees have many applications in computer science. Perhaps原创 2015-11-12 14:34:39 · 507 阅读 · 0 评论 -
二叉树的基本操作
多文件组织:main.cpp:#include #include#include#include"btree.h"using namespace std;void CreateBTNode(BTNode *&b,char *str);BTNode *FindNode(BTNode *b,ElemType x);BTNode *LchildNode(BTNode *p);BT原创 2016-06-05 09:21:50 · 545 阅读 · 0 评论 -
数据结构二叉树的递归遍历
btree.h#ifndef BTREE_H_INCLUDED#define BTREE_H_INCLUDEDtypedef char ElemType;#define MaxSize 101typedef struct node{ ElemType data; struct node *lchild; struct node *rchild;}BTNode原创 2016-06-05 09:57:59 · 353 阅读 · 0 评论 -
用二叉树遍历思想解决的一些问题
(1)计算二叉树节点个数;#include #include"btree.h"#includeusing namespace std;int Nodes(BTNode *b){ if(b==NULL) return 0; else return Nodes(b->lchild)+Nodes(b->rchild)+1;}int mai原创 2016-06-05 10:41:02 · 446 阅读 · 0 评论