https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/Givenanarraywhereelementsaresortedinascendingorder,convertittoaheightbalancedBST.Forthi...

Givenabinarytree,finditsminimumdepth.Theminimumdepthisthenumberofnodesalongtheshortestpathfromtherootnodedowntothenearestleafnode.Note: Aleafisanodewithnoc...

Givenabinarytree,determineifitisheight-balanced.Forthisproblem,aheight-balancedbinarytreeisdefinedas:/abinarytreeinwhichthedepthofthetwosubtreesofeverynodenever...

 publicclassTreeNode{publicintval;publicTreeNodeleft;publicTreeNoderight;publicTreeNode(intx){val=x;}}打印代码privatevoidWriteTreeNode(TreeNodenode){StringBuil...

Invertabinarytree.Example:Input:4/27//1369Output:4/72//9631Trivia:ThisproblemwasinspiredbythisoriginaltweetbyMaxHowell:/Google:90%ofourengineersusethesoftwareyo...

Givenabinarysearchtree(BST),findthelowestcommonancestor(LCA)oftwogivennodesintheBST.AccordingtothedefinitionofLCAonWikipedia:“Thelowestcommonancestorisdef...

Givenabinarytree,returnallroot-to-leafpaths.Note: Aleafisanodewithnochildren.Example:Input:1/235Output:["1->2->5","1->3"]Explanation:Allroot-to-le...

Givenabinarysearchtree(BST)withduplicates,findallthe mode(s) (themostfrequentlyoccurredelement)inthegivenBST.AssumeaBSTisdefinedasfollows:Theleftsubtr...

Givenabinarytree,youneedtocomputethelengthofthediameterofthetree.Thediameterofabinarytreeisthelengthofthelongestpathbetweenanytwonodesinatree.Thispathmayormayno...

一.二分搜索树：1.代码：publicclassBST<EextendsComparable<E>>{privateclassNode{publicEe;publicNodeleft;publicNoderight;publicNode(Ee){this.e=e;left=null;right=...

　　此测试仅用于二叉树基本的性质测试，不包含插入、删除测试（此类一般属于有序树基本操作）。//二叉树树类publicclassBinaryTree{publicTreeNoderoot;//有一个根节点publicstaticintindex;publicTreeNodeCreateBTree(int[]a){Tree...

Givenanintegerarraywithnoduplicates.Amaximumtreebuildingonthisarrayisdefinedasfollow:Therootisthemaximumnumberinthearray.Theleftsubtreeisthemaximumtreeconstruct...

 publicclassSolution{publicstaticvoidmain(String[]args){intdNum=1264;Stringstr="";while(dNum>0){intrem=dNum%2;str=rem+str;dNum=dNum/2;}System.out.printl...

 packagetestpacknm;importjava.util.Scanner;publicclasstestcnm{publicstaticvoidmain(String[]args){intdNum=5;System.out.println("Binaryis:"+Integer.toBinaryS...

  classSolution{public:vector<vector<int>>findLeaves(TreeNode*root){vector<vector<int>>res;while(root){vector<int>leaves...