二叉树常见算法.docxVIP

二叉树的常见算法: 二叉树的定义： /** DefinitionofTreeNode @authorZhy * */publicclassTreeNode{intval;TreeNodeleft;TreeNoderight;publicTreeNode(intval){this.val=val;} }获得二叉树的节点个数: /** method:recursionO(n)SystemStack〃递归 note:rootisnull:0; rootisnotnull,returnleft+right+1; @paramroot @return */ publicintgetNumberRec(TreeNoderoot){if(root==null)return0;returngetNumberRec(root.left)+getNumberRec(root.right)+1; } /** method:IterationO(n)Queue〃迭代 @paramroot @return */ publicintgetNum(TreeNoderoot){if(root==null)return0;intnum=1;LinkedListTreeNodequeue=newLinkedListTreeNode();queue.add(root);while(!queue.isEmpty()){T