1.二叉樹寬度遍歷

https://blog.csdn.net/weixin_39912556/article/details/82852749

2.二叉樹深度遍歷#

https://blog.csdn.net/weixin_39912556/article/details/82852749

3.二叉樹最大深度

class Solution {public int maxDepth(TreeNode root) {if(root == null) {return 0;} else {int left = maxDepth(root.left);int right = maxDepth(root.right);return Math.max(left, right) + 1;}} }

4.將有序數組轉換為二叉搜索樹

/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/ class Solution {public TreeNode sortedArrayToBST(int[] nums) {return sortedArrayToBST(nums, 0, nums.length); }private TreeNode sortedArrayToBST(int[] nums, int start, int end) {if (start == end) {return null;}int mid = (start + end) >>> 1;TreeNode root = new TreeNode(nums[mid]);root.left = sortedArrayToBST(nums, start, mid);root.right = sortedArrayToBST(nums, mid + 1, end);return root;} }

5.判斷是否為對稱二叉樹

/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/ class Solution {public boolean isSymmetric(TreeNode root) {return isMirror(root,root);}private boolean isMirror(TreeNode q,TreeNode p){if(q==null&&p==null){return true;}if(q==null||p==null){return false;}return (q.val==p.val)&&isMirror(q.right,p.left)&&isMirror(q.left,p.right);} }

6.中序排列

中 ：左中右
前：中左右
后：左右中

class Solution {public List<Integer> inorderTraversal(TreeNode root) {List<Integer> res = new ArrayList<>();helper(root,res);return res;}public void helper(TreeNode root,List<Integer> res){if(root!=null){if(root.left!=null){helper(root.left,res);}res.add(root.val);if(root.right!=null){helper(root.right,res);}}} }

總結

以上是生活随笔為你收集整理的RUSH二叉树的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。