What is the construction and traversal method of Java binary tree

Today, the editor will share with you the relevant knowledge about the structure and traversal method of Java binary tree. The content is detailed and the logic is clear. I believe most people still know too much about this knowledge, so share this article for your reference. I hope you can get something after reading this article. Let's take a look.

Topic one

Solution method

/ * Definition for a binary tree node. * public class TreeNode {* int val; * TreeNode left; * TreeNode right; * TreeNode () {} * TreeNode (int val) {this.val = val;} * TreeNode (int val, TreeNode left, TreeNode right) {* this.val = val; * this.left = left; * this.right = right * / class Solution {public TreeNode constructMaximumBinaryTree (int [] nums) {return method (nums,0,nums.length-1);} public TreeNode method (int [] nums,int lo,int hi) {if (lo > hi) {return null;} int index =-1; int max = Integer.MIN_VALUE; for (int I = lo;i